On the public citation graph

On computing the voronoi diagram for restricted planar figures

https://doi.org/10.1007/bfb0028250
0 signed · 33 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
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.1016/0020-0190(89)90043-4openalex-snapshot
Voronoi diagrams with barriers and the shortest diagonal problem
inferredcites →https://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/28395.28400openalex-snapshot
A Linear time algorithm for computing the Voronoi diagram of a convex polygon
inferredcites →https://doi.org/10.1145/323233.323270openalex-snapshot
On partitioning polygons
inferredcites →https://doi.org/10.1145/41958.41982openalex-snapshot
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.

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-58218-5_7openalex-snapshot
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_161openalex-snapshot
Hamiltonian abstract Voronoi diagrams in linear time
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.1007/3-540-60313-1_172openalex-snapshot
Fast skeleton construction
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_35openalex-snapshot
Linear-time reconstruction of Delaunay triangulations with applications
inferred← citeshttps://doi.org/10.1007/978-3-658-37711-3_6openalex-snapshot
Berechnung des Voronoi-Diagramms
inferred← citeshttps://doi.org/10.1007/bf01989747openalex-snapshot
Efficiently updating constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bfb0015444openalex-snapshot
Finding the medial axis of a simple polygon in linear time
inferred← citeshttps://doi.org/10.1007/pl00009429openalex-snapshot
Finding the Medial Axis 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/s0304-3975(96)00024-2openalex-snapshot
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1145/142675.142738openalex-snapshot
Manhattonian proximity in a simple polygon
inferred← citeshttps://doi.org/10.1145/160985.161008openalex-snapshot
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
inferred← citeshttps://doi.org/10.1145/262839.263025openalex-snapshot
Good orders for incremental (re)construction
inferred← citeshttps://doi.org/10.11606/d.45.2022.tde-30032022-172201openalex-snapshot
Cobertura com círculos de raio mínimo
inferred← citeshttps://doi.org/10.1201/9780367803735-7openalex-snapshot
Geometric Proximity Graphs
inferred← citeshttps://doi.org/10.1201/b10626openalex-snapshot
Geometric Data Structures for Computer Graphics
inferred← citeshttps://doi.org/10.1201/b10626-12openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1515/geocart-2017-0004openalex-snapshot
Area collapse algorithm computing new curve of 2D geometric objects
inferred← citeshttps://doi.org/10.5860/choice.44-0357openalex-snapshot
Geometric data structures for computer graphics
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.