On the public citation graph
Efficiently updating constrained Delaunay triangulations
0 signed · 20 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01840358openalex-snapshot
On approximation behavior of the greedy triangulation for convex polygons
inferredcites →https://doi.org/10.1007/bf01994882openalex-snapshot
Fast algorithms for greedy triangulation
inferredcites →https://doi.org/10.1007/bf02187695openalex-snapshot
Generalized delaunay triangulation for planar graphs
inferredcites →https://doi.org/10.1007/bf02187749openalex-snapshot
A linear-time algorithm for computing the voronoi diagram of a convex polygon
inferredcites →https://doi.org/10.1007/bfb0028250openalex-snapshot
On computing the voronoi diagram for restricted planar figures
inferredcites →https://doi.org/10.1007/bfb0042804openalex-snapshot
A space efficient algorithm for the greedy triangulation
inferredcites →https://doi.org/10.1016/0020-0190(89)90043-4openalex-snapshot
Voronoi diagrams with barriers and the shortest diagonal problem
inferredcites →https://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferredcites →https://doi.org/10.1145/41958.41982openalex-snapshot
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_24openalex-snapshot
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_220openalex-snapshot
On greedy tetrahedralization of points in 3D
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_150openalex-snapshot
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)89149-3openalex-snapshot
Fast greedy triangulation algorithms
inferred← citeshttps://doi.org/10.1137/s0097539795285916openalex-snapshot
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1145/177424.177649openalex-snapshot
Fast greedy triangulation algorithms
inferred← citeshttps://doi.org/10.1145/220279.220303openalex-snapshot
Triangulations intersect nicely
inferred← citeshttps://doi.org/10.1145/220279.220305openalex-snapshot
New algorithms and empirical findings on minimum weight triangulation heuristics (extended abstract)
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.