On the public citation graph
On the construction of abstract voronoi diagrams
0 signed · 92 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/3-540-50335-8_31openalex-snapshot
Abstract voronoi diagrams and their applications
inferredcites →https://doi.org/10.1007/3-540-50728-0_61openalex-snapshot
Voronoi diagrams in the moscow metric
inferredcites →https://doi.org/10.1007/3-540-52055-4openalex-snapshot
Concrete and Abstract Voronoi Diagrams
inferredcites →https://doi.org/10.1007/3-540-52921-7_63openalex-snapshot
On the construction of abstract voronoi diagrams, II
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/bf02187867openalex-snapshot
Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
inferredcites →https://doi.org/10.1007/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1007/bfb0035852openalex-snapshot
Voronoi diagrams based on general metrics in the plane
inferredcites →https://doi.org/10.1016/0020-0190(79)90074-7openalex-snapshot
Voronoi diagrams from convex hulls
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.1016/0196-6774(88)90035-1openalex-snapshot
Improved algorithms for discs and balls using power diagrams
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1137/0214006openalex-snapshot
Voronoi Diagram in the Laguerre Geometry and Its Applications
inferredcites →https://doi.org/10.1137/0214034openalex-snapshot
Intersection and Closest-Pair Problems for a Set of Planar Discs
inferredcites →https://doi.org/10.1137/0216006openalex-snapshot
Power Diagrams: Properties, Algorithms and Applications
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/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73395openalex-snapshot
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1998.0984openalex-snapshot
Optimal Point Placement for Mesh Smoothing
inferred← citeshttps://doi.org/10.1007/11602613_100openalex-snapshot
Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_52openalex-snapshot
Dynamic Additively Weighted Voronoi Diagrams in 2D
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_63openalex-snapshot
On the construction of abstract voronoi diagrams, II
inferred← citeshttps://doi.org/10.1007/3-540-54891-2_1openalex-snapshot
The post office problem for fuzzy point sets
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_205openalex-snapshot
Four results on randomized incremental constructions
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_20openalex-snapshot
Selected topics from computational geometry, data structures and motion planning
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_76openalex-snapshot
“The big sweep”: On the power of the wavefront approach to Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_65openalex-snapshot
Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_60openalex-snapshot
Voronoi diagrams for polygon-offset distance functions
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_3openalex-snapshot
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-322-95233-2_17openalex-snapshot
Randomized Incremental Construction of Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_11openalex-snapshot
Voronoi Diagrams with a Transportation Network on the Euclidean Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_9openalex-snapshot
A Fast Algorithm for Data Collection along a Fixed Track
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_18openalex-snapshot
On the Complexity of Higher Order Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_29openalex-snapshot
Abstract Voronoi Diagrams with Disconnected Regions
inferred← citeshttps://doi.org/10.1007/978-3-642-60243-6_25openalex-snapshot
Uncertain Neighborhood Relations of Point Sets and Fuzzy Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/bf01190848openalex-snapshot
Using geometry to solve the transportation problem in the plane
inferred← citeshttps://doi.org/10.1007/bf01228508openalex-snapshot
A semidynamic construction of higher-order voronoi diagrams and its randomized analysis
inferred← citeshttps://doi.org/10.1007/bf01940875openalex-snapshot
Randomized geometric algorithms and pseudorandom generators
inferred← citeshttps://doi.org/10.1007/bf01975867openalex-snapshot
Incremental topological flipping works for regular triangulations
inferred← citeshttps://doi.org/10.1007/bf02523236openalex-snapshot
“The big sweep”: On the power of the wavefront approach to Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf02570705openalex-snapshot
On lazy randomized incremental construction
inferred← citeshttps://doi.org/10.1007/bf02716580openalex-snapshot
A compact piecewise-linear voronoi diagram for convex sites in the plane
inferred← citeshttps://doi.org/10.1007/bfb0028249openalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferred← citeshttps://doi.org/10.1007/bfb0032049openalex-snapshot
Merging free trees in parallel for efficient voronoi diagram construction
inferred← citeshttps://doi.org/10.1007/pl00009429openalex-snapshot
Finding the Medial Axis of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1007/s00454-003-2947-0openalex-snapshot
Quickest Paths, Straight Skeletons, and the City Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/s004540010081openalex-snapshot
Voronoi diagrams for convex polygon-offset distance functions
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90263-uopenalex-snapshot
Searching for segments with largest relative overlap
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/0925-7721(92)90025-nopenalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90033-3openalex-snapshot
Randomized incremental construction of abstract Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00018-6openalex-snapshot
Average case analysis of dynamic geometric optimization
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50025-0openalex-snapshot
Geometric Algorithms
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/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50017-6openalex-snapshot
Randomized Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.cad.2022.103374openalex-snapshot
Robust Construction of Voronoi Diagrams of Spherical Balls in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.03.002openalex-snapshot
Abstract Voronoi diagrams revisited
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.008openalex-snapshot
On the complexity of higher order abstract Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.08.004openalex-snapshot
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.06.002openalex-snapshot
Abstract Voronoi diagram in 3-space
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.037openalex-snapshot
A fast algorithm for data collection along a fixed track
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00136-1openalex-snapshot
On non-smooth convex distance functions
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00017-xopenalex-snapshot
Voronoi Diagrams on orbifolds
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00020-xopenalex-snapshot
Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
inferred← citeshttps://doi.org/10.1109/iadcc.2015.7154822openalex-snapshot
Fuzzy based dynamic load balancing scheme for efficient edge server selection in Cloud-oriented content delivery network using Voronoi diagram
inferred← citeshttps://doi.org/10.1109/isvd.2010.12openalex-snapshot
Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185369openalex-snapshot
Dynamic maintenance of geometric structures made easy
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267815openalex-snapshot
Randomized geometric algorithms and pseudo-random generators
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366829openalex-snapshot
A compact piecewise-linear Voronoi diagram for convex sites in the plane
inferred← citeshttps://doi.org/10.1109/tc.2007.1030openalex-snapshot
New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization
inferred← citeshttps://doi.org/10.1142/s0218195906001963openalex-snapshot
VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
inferred← citeshttps://doi.org/10.1142/s0218195914600115openalex-snapshot
ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS
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/142675.142688openalex-snapshot
Incremental topological flipping works for regular triangulations
inferred← citeshttps://doi.org/10.1145/160985.161007openalex-snapshot
Convex distance functions in 3-space are different
inferred← citeshttps://doi.org/10.1145/195058.195113openalex-snapshot
On lazy randomized incremental construction
inferred← citeshttps://doi.org/10.1145/380752.380815openalex-snapshot
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
inferred← citeshttps://doi.org/10.1145/513400.513420openalex-snapshot
Quickest paths, straight skeletons, and the city Voronoi diagram
inferred← citeshttps://doi.org/10.3233/fi-1995-2242openalex-snapshot
CONVEX DISTANCE FUNCTIONS IN 3-SPACE ARE DIFFERENT
inferred← citeshttps://doi.org/10.48550/arxiv.0812.0607openalex-snapshot
Dilation, smoothed distance, and minimization diagrams of convex functions
inferred← citeshttps://doi.org/10.5555/314161.314383openalex-snapshot
Optimal point placement for mesh smoothing
inferred← citeshttps://doi.org/10.5555/314464.314481openalex-snapshot
Average case analysis of dynamic geometric optimization
inferred← citeshttps://doi.org/10.6688/jise.2014.30.5.9openalex-snapshot
Travel Time Distances Induced by Transportation Networks and General Underlying Distances
inferred← citeshttps://doi.org/10.7146/dpb.v20i373.6605openalex-snapshot
A Sweepline Algorithm for Generalized Delaunay Triangulations
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.