On the public citation graph

Fully dynamic delaunay triangulation in logarithmic expected time per operation

https://doi.org/10.1007/bfb0028249
0 signed · 28 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.1002/047172209x.ch2openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf00977785openalex-snapshot
Two algorithms for constructing a Delaunay triangulation
inferredcites →https://doi.org/10.1007/bf01228508openalex-snapshot
A semidynamic construction of higher-order voronoi diagrams and its randomized analysis
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
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/bf02293035openalex-snapshot
Applications of random sampling to on-line algorithms in computational geometry
inferredcites →https://doi.org/10.1007/bf02574686openalex-snapshot
On the construction of abstract voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02574692openalex-snapshot
On levels in arrangements and voronoi diagrams
inferredcites →https://doi.org/10.1007/bfb0028249openalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferredcites →https://doi.org/10.1007/bfb0032048openalex-snapshot
Randomized incremental construction of delaunay and Voronoi diagrams
inferredcites →https://doi.org/10.1016/0304-3975(93)90024-nopenalex-snapshot
On the randomized construction of the Delaunay tree
inferredcites →https://doi.org/10.1093/comjnl/21.2.168openalex-snapshot
Computing Dirichlet Tessellations in the Plane
inferredcites →https://doi.org/10.1145/10515.10543openalex-snapshot
The hierarchical representation of objects: the Delaunay tree
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/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

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-55210-3_205openalex-snapshot
Four results on randomized incremental constructions
inferred← citeshttps://doi.org/10.1007/978-94-011-5588-5_40openalex-snapshot
Synthesis of Reconfigurable-Fixture Support Configurations for Thin-Walled Objects
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90024-nopenalex-snapshot
On the randomized construction of the Delaunay tree
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50017-6openalex-snapshot
Randomized Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1109/34.625128openalex-snapshot
Discrete Voronoi diagrams and the SKIZ operator: a dynamic algorithm
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185369openalex-snapshot
Dynamic maintenance of geometric structures made easy
inferred← citeshttps://doi.org/10.1142/s021819599200007xopenalex-snapshot
RANDOMIZATION YIELDS SIMPLE O(n log ⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
inferred← citeshttps://doi.org/10.1145/109648.109662openalex-snapshot
Randomized multidimensional search trees (extended abstract)
showing the first 9 of 10 · page through all 10
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.