On the public citation graph

Geometric relations among Voronoi diagrams

https://doi.org/10.1007/bfb0039594
0 signed · 31 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/3-540-16761-7_51openalex-snapshot
A new duality result concerning Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf00149360openalex-snapshot
Dirichletsche Zellenkomplexe mit maximaler Eckenzahl
inferredcites →https://doi.org/10.1007/bf00164401openalex-snapshot
Generalized Dirichlet tessellations
inferredcites →https://doi.org/10.1007/bf00181470openalex-snapshot
Recognizing Dirichlet tessellations
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02187681openalex-snapshot
Voronoi diagrams and arrangements
inferredcites →https://doi.org/10.1007/bf02187870openalex-snapshot
A criterion for the affine equivalence of cell complexes inR d and convex polyhedra inR d+1
inferredcites →https://doi.org/10.1007/bf02187890openalex-snapshot
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
inferredcites →https://doi.org/10.1016/0020-0190(86)90055-4openalex-snapshot
The one-dimensional weighted voronoi diagram
inferredcites →https://doi.org/10.1016/0031-3203(84)90064-5openalex-snapshot
An optimal algorithm for constructing the weighted voronoi diagram in the plane
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1112/s0025579300002850openalex-snapshot
The maximum numbers of faces of a convex polytope
inferredcites →https://doi.org/10.1137/0210006openalex-snapshot
Generalization of Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0214006openalex-snapshot
Voronoi Diagram in the Laguerre Geometry and Its Applications
inferredcites →https://doi.org/10.1137/0215022openalex-snapshot
Computing the Largest Empty Rectangle
inferredcites →https://doi.org/10.1137/0216006openalex-snapshot
Power Diagrams: Properties, Algorithms and Applications
inferredcites →https://doi.org/10.1145/10515.10549openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1145/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.14288/1.0051821openalex-snapshot
A convex hull algorithm optimal for point sets in even dimensions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1096-987x(19970715)18:9<1113::aid-jcc1>3.0.co;2-uopenalex-snapshot
Voronoi cell: New method for allocation of space among atoms: Elimination of avoidable errors in calculation of atomic volume and density
inferred← citeshttps://doi.org/10.1007/s00454-010-9256-1openalex-snapshot
Bregman Voronoi Diagrams
inferred← citeshttps://doi.org/10.1016/j.cagd.2008.09.010openalex-snapshot
Computing the Voronoi cells of planes, spheres and cylinders in
inferred← citeshttps://doi.org/10.1016/j.str.2007.10.007openalex-snapshot
MOLE: A Voronoi Diagram-Based Explorer of Molecular Channels, Pores, and Tunnels
inferred← citeshttps://doi.org/10.1109/sibgrapi.2012.25openalex-snapshot
Connectivity Oblivious Merging of Triangulations
inferred← citeshttps://doi.org/10.1111/cgf.12274openalex-snapshot
A Weighted Delaunay Triangulation Framework for Merging Triangulations in a Connectivity Oblivious Fashion
inferred← citeshttps://doi.org/10.1145/100216.100260openalex-snapshot
Solving query-retrieval problems by compacting Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/1364901.1364911openalex-snapshot
Computing the Voronoi cells of planes, spheres and cylinders in R 3
inferred← citeshttps://doi.org/10.1145/73393.73406openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferred← citeshttps://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
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.