On the public citation graph
A compact piecewise-linear voronoi diagram for convex sites in the plane
0 signed · 94 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-52055-4openalex-snapshot
Concrete and Abstract Voronoi Diagrams
inferredcites →https://doi.org/10.1007/978-3-642-62035-5openalex-snapshot
An Introduction to the Geometry of Numbers
inferredcites →https://doi.org/10.1007/bf01758770openalex-snapshot
Randomized incremental construction of Delaunay and Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
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/bf02187890openalex-snapshot
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
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.1016/0196-6774(85)90021-5openalex-snapshot
A “retraction” method for planning the motion of a disc
inferredcites →https://doi.org/10.1016/0196-6774(85)90039-2openalex-snapshot
Computing the extreme distances between two convex polygons
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.1016/0925-7721(92)90025-nopenalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferredcites →https://doi.org/10.1016/0925-7721(93)90033-3openalex-snapshot
Randomized incremental construction of abstract Voronoi diagrams
inferredcites →https://doi.org/10.1109/5.163412openalex-snapshot
Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1142/s0218195999000054openalex-snapshot
COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
inferredcites →https://doi.org/10.1145/10515.10543openalex-snapshot
The hierarchical representation of objects: the Delaunay tree
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/160985.161009openalex-snapshot
Tentative prune-and-search for computing Voronoi vertices
inferredcites →https://doi.org/10.1145/167088.167224openalex-snapshot
Piecewise linear paths among convex obstacles
inferredcites →https://doi.org/10.1145/323233.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.3233/fi-1995-2243openalex-snapshot
TENTATIVE PRUNE-AND-SEARCH FOR COMPUTING FIXED-POINTS WITH APPLICATIONS TO GEOMETRIC COMPUTATION
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcph.1999.6194openalex-snapshot
Semi-Lagrangian Methods for Level Set Equations
inferred← citeshttps://doi.org/10.1006/jcph.1999.6205openalex-snapshot
Tree Methods for Moving Interfaces
inferred← citeshttps://doi.org/10.1006/jcph.1999.6259openalex-snapshot
Fast Tree-Based Redistancing for Level Set Computations
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_30openalex-snapshot
Compact Voronoi Diagrams for Moving Convex Polygons
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_21openalex-snapshot
Separation Sensitive Kinetic Separation Structures for Convex Polygons
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_8openalex-snapshot
Optimizing Constrained Offset and Scaled Polygonal Annuli
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_144openalex-snapshot
Straight skeletons for general polygonal figures in the plane
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-030-24766-9_12openalex-snapshot
On the Minimum Consistent Subset Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-55973-1_53openalex-snapshot
Set Voronoi Tessellation for Particulate Systems in Two Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_3openalex-snapshot
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_22openalex-snapshot
Gathering Asynchronous Robots in the Presence of Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_12openalex-snapshot
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_32openalex-snapshot
The Voronoi Diagram of Planar Convex Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-85126-4_13openalex-snapshot
Robust Point-Location in Generalized Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_8openalex-snapshot
Computation of Non-dominated Points Using Compact Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_9openalex-snapshot
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters
inferred← citeshttps://doi.org/10.1007/bfb0054355openalex-snapshot
An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
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/pl00009479openalex-snapshot
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
inferred← citeshttps://doi.org/10.1007/s00453-016-0118-yopenalex-snapshot
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
inferred← citeshttps://doi.org/10.1007/s00453-021-00824-9openalex-snapshot
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
inferred← citeshttps://doi.org/10.1007/s004540010081openalex-snapshot
Voronoi diagrams for convex polygon-offset distance functions
inferred← citeshttps://doi.org/10.1007/s10878-020-00691-0openalex-snapshot
Optimal conditions for connectedness of discretized sets
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/j.comgeo.2009.03.002openalex-snapshot
Abstract Voronoi diagrams revisited
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.004openalex-snapshot
Divide-and-conquer for Voronoi diagrams revisited
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101698openalex-snapshot
Computation of spatial skyline points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101744openalex-snapshot
Euclidean minimum spanning trees with independent and dependent geometric uncertainties
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102021openalex-snapshot
Half-plane point retrieval queries with independent and dependent geometric uncertainties
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.10.009openalex-snapshot
Robustness of k-gon Voronoi diagram construction
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.004openalex-snapshot
Optimizing a constrained convex polygonal annulus
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)80001-xopenalex-snapshot
Locational optimization problems solved through Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/s0723-0869(04)80009-4openalex-snapshot
The geometry of minkowski spaces — A survey. Part II
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00055-3openalex-snapshot
Queries with segments in Voronoi diagrams
inferred← citeshttps://doi.org/10.1017/s0263574711001342openalex-snapshot
Vodec: A fast Voronoi algorithm for car-like robot path planning in dynamic scenarios
inferred← citeshttps://doi.org/10.1080/00038628.2024.2321584openalex-snapshot
D 4 G framework: a novel Voronoi diagram classification for decoding natural geometrics to enhance the built environment
inferred← citeshttps://doi.org/10.1088/1361-651x/ae0c25openalex-snapshot
Topological modeling of metallic foams
inferred← citeshttps://doi.org/10.1109/43.980255openalex-snapshot
Shortest path search using tiles and piecewise linear cost propagation
inferred← citeshttps://doi.org/10.1109/dasc50938.2020.9256624openalex-snapshot
Rule-Based Path Planning for Unmanned Aerial Vehicles in Non-Segregated Air Space over Congested Areas
inferred← citeshttps://doi.org/10.1109/isvd.2006.31openalex-snapshot
Robust Point-Location in Generalized Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/isvd.2007.32openalex-snapshot
On Sweep-plane Analysis of Laguerre Voronoi Diagram
inferred← citeshttps://doi.org/10.1109/mmit.2010.23openalex-snapshot
An Effective Algorithm for GVD Generation
inferred← citeshttps://doi.org/10.1109/mvhi.2010.160openalex-snapshot
A Geometric Method for the Path Generation of a Robot
inferred← citeshttps://doi.org/10.1109/rait.2016.7507963openalex-snapshot
Algorithm of 2D-Voronoi diagram construction with rectangular block
inferred← citeshttps://doi.org/10.1142/s0218195902000724openalex-snapshot
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195908002763openalex-snapshot
THE PREDICATES FOR THE EXACT VORONOI DIAGRAM OF ELLIPSES UNDER THE EUCLIDIEAN METRIC
inferred← citeshttps://doi.org/10.1142/s0218195921500059openalex-snapshot
Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
inferred← citeshttps://doi.org/10.1142/s0218195997000296openalex-snapshot
Faster Circle Packing with Application to Nonobtuse Triangulation
inferred← citeshttps://doi.org/10.1145/1137856.1137891openalex-snapshot
The predicates for the Voronoi diagram of ellipses
inferred← citeshttps://doi.org/10.1145/1236246.1236266openalex-snapshot
A real-time and exact implementation of the predicates for the Voronoi diagram of parametric ellipses
inferred← citeshttps://doi.org/10.1145/1542362.1542401openalex-snapshot
Divide-and-conquer for Voronoi diagrams revisited
inferred← citeshttps://doi.org/10.1145/2462356.2462377openalex-snapshot
Computing shortest paths among curved obstacles in the plane
inferred← citeshttps://doi.org/10.1145/2493132.2462377openalex-snapshot
Computing shortest paths among curved obstacles in the plane
inferred← citeshttps://doi.org/10.1145/2660771openalex-snapshot
Computing Shortest Paths among Curved Obstacles in the Plane
inferred← citeshttps://doi.org/10.1145/276884.276891openalex-snapshot
Raising roofs, crashing cycles, and playing pool
inferred← citeshttps://doi.org/10.1145/336154.336219openalex-snapshot
Kinetic collision detection for simple polygons
inferred← citeshttps://doi.org/10.1177/0278364915625345openalex-snapshot
Efficient collision checking in sampling-based motion planning via safety certificates
inferred← citeshttps://doi.org/10.15837/ijccc.2014.4.31openalex-snapshot
A Method to Construct Approximate Fuzzy Voronoi Diagram for Fuzzy Numbers of Dimension Two
inferred← citeshttps://doi.org/10.3233/ifs-130811openalex-snapshot
Fuzzy Voronoi diagram for disjoint fuzzy numbers of dimension two
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5838openalex-snapshot
Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95231openalex-snapshot
Skeletal representations of orthogonal shapes
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.