On the public citation graph
Sorting helps for voronoi diagrams
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.
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/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bf01786986openalex-snapshot
A priority queue in which initialization and queue operations takeO(loglogD) time
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1016/0022-0000(89)90044-5openalex-snapshot
There are planar graphs almost as good as the complete graph
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50017-7openalex-snapshot
A Method for Proving Lower Bounds for Certain Geometric Problems
inferredcites →https://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
inferredcites →https://doi.org/10.1137/0220041openalex-snapshot
Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
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/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.1145/323233.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
inferredcites →https://doi.org/10.1145/73833.73866openalex-snapshot
Fast geometric approximation techniques and geometric embedding problems
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
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-44676-1_26openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/bf01994879openalex-snapshot
Finding thek smallest spanning trees
inferred← citeshttps://doi.org/10.1007/s00453-002-0939-8openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/s00454-011-9346-8openalex-snapshot
Computing Hereditary Convex Structures
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90139-oopenalex-snapshot
On the angle restricted nearest neighbor problem
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90252-bopenalex-snapshot
Fast geometric approximation techniques and geometric embedding problems
inferred← citeshttps://doi.org/10.1016/s0895-7177(97)00145-3openalex-snapshot
Fine-grain discrete Voronoi diagram algorithms in L1 and L∞ norms
inferred← citeshttps://doi.org/10.1109/focs.2006.62openalex-snapshot
Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry
inferred← citeshttps://doi.org/10.1109/focs.2009.53openalex-snapshot
Delaunay Triangulations in O(sort(n)) Time and More
inferred← citeshttps://doi.org/10.1137/07068669xopenalex-snapshot
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
inferred← citeshttps://doi.org/10.1145/142675.142738openalex-snapshot
Manhattonian proximity in a simple polygon
inferred← citeshttps://doi.org/10.1145/1542362.1542374openalex-snapshot
Computing hereditary convex structures
inferred← citeshttps://doi.org/10.1145/1944345.1944347openalex-snapshot
Delaunay triangulations in O (sort( n )) time and more
inferred← citeshttps://doi.org/10.1145/276884.276916openalex-snapshot
On enumerating and selecting distances
inferred← citeshttps://doi.org/10.1145/73833.73866openalex-snapshot
Fast geometric approximation techniques and geometric embedding problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0205010openalex-snapshot
Approximate Data Structures with Applications
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.