On the public citation graph
A semidynamic construction of higher-order voronoi diagrams and its randomized analysis
0 signed · 54 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/bf01758770openalex-snapshot
Randomized incremental construction of Delaunay and 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/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
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/bf02574694openalex-snapshot
Higher-dimensional voronoi diagrams in linear expected time
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.1109/ms.2024.3399277openalex-snapshot
IEEE Transactions on Computers
inferredcites →https://doi.org/10.1109/sfcs.1989.63540openalex-snapshot
On obstructions in relation to a fixed viewpoint
inferredcites →https://doi.org/10.1109/tc.1982.1676031openalex-snapshot
On k-Nearest Neighbor Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/10515.10543openalex-snapshot
The hierarchical representation of objects: the Delaunay tree
inferredcites →https://doi.org/10.1145/323233.323263openalex-snapshot
An improved algorithm for constructing kth-order Voronoi diagrams
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
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-55488-2_20openalex-snapshot
Selected topics from computational geometry, data structures and motion planning
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-642-23719-5_7openalex-snapshot
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_6openalex-snapshot
Higher Order City Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_21openalex-snapshot
On Higher Order Voronoi Diagrams of Line Segments
inferred← citeshttps://doi.org/10.1007/bfb0028249openalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferred← citeshttps://doi.org/10.1007/s00453-013-9809-9openalex-snapshot
The k-Nearest-Neighbor Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1007/s00453-018-00536-7openalex-snapshot
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/s10898-024-01386-0openalex-snapshot
The edge labeling of higher order Voronoi diagrams
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/0304-3975(95)00174-3openalex-snapshot
An introduction to randomization in computational geometry
inferred← citeshttps://doi.org/10.1016/j.automatica.2018.12.028openalex-snapshot
Higher order mobile coverage control with applications to clustering of discrete sets
inferred← citeshttps://doi.org/10.1016/j.cag.2009.03.013openalex-snapshot
Surface reconstruction using bivariate simplex splines on Delaunay configurations
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.ipl.2013.07.023openalex-snapshot
Order-k α-hulls and α-shapes
inferred← citeshttps://doi.org/10.1016/j.physa.2021.126460openalex-snapshot
Degree distributions in AB random geometric graphs
inferred← citeshttps://doi.org/10.1016/j.pmcj.2007.11.001openalex-snapshot
Efficient data dissemination using locale covers
inferred← citeshttps://doi.org/10.1090/s0002-9947-07-03976-1openalex-snapshot
Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay
inferred← citeshttps://doi.org/10.1109/acc.2015.7170938openalex-snapshot
Higher order Voronoi based mobile coverage control
inferred← citeshttps://doi.org/10.1109/geoinformatics.2011.5980668openalex-snapshot
Topology constrain for river dimension-reducing generalization in land-use map
inferred← citeshttps://doi.org/10.1109/icmtma.2015.10openalex-snapshot
A Faster Algorithm of Higher Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/tvcg.2011.156openalex-snapshot
Spherical DCB-Spline Surfaces with Hierarchical and Adaptive Knot Insertion
inferred← citeshttps://doi.org/10.1137/s0097539795281840openalex-snapshot
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1137/s0097539798349188openalex-snapshot
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
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.109664openalex-snapshot
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/1099554.1099608openalex-snapshot
Efficient data dissemination using locale covers
inferred← citeshttps://doi.org/10.1145/1247069.1247100openalex-snapshot
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams
inferred← citeshttps://doi.org/10.1145/177424.177521openalex-snapshot
Constructing levels in arrangements and higher order Voronoi diagrams
inferred← citeshttps://doi.org/10.3390/ijgi12040172openalex-snapshot
Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1204.4374openalex-snapshot
Higher Order City Voronoi Diagrams
inferred← citeshttps://doi.org/10.48550/arxiv.1703.02424openalex-snapshot
Higher order mobile coverage control with application to localization
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.