On the public citation graph

Order-k voronoi diagrams of sites with additive weights in the plane

https://doi.org/10.1007/bf01759056
0 signed · 33 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.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf00164401openalex-snapshot
Generalized Dirichlet tessellations
inferredcites →https://doi.org/10.1007/bf00181432openalex-snapshot
Circles through two points that always enclose many points
inferredcites →https://doi.org/10.1007/bf01840438openalex-snapshot
Edge-skeletons in arrangements with applications
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.1109/mmul.2024.3414106openalex-snapshot
IEEE Transactions on Computers
inferredcites →https://doi.org/10.1109/tc.1982.1675946openalex-snapshot
An Optimal Illumination Region Algorithm for Convex Polygons
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/0210006openalex-snapshot
Generalization of Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1145/10515.10549openalex-snapshot
A sweepline algorithm for Voronoi diagrams
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/323233.323263openalex-snapshot
An improved algorithm for constructing kth-order Voronoi diagrams
inferredcites →https://doi.org/10.1145/73393.73406openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.

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-45643-0_12openalex-snapshot
Topological Sweep in Degenerate Cases
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_7openalex-snapshot
Computing the furthest site voronoi diagram for a set of discs
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_3openalex-snapshot
Faster Algorithms for Cycle Hitting Problems on Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36092-3_6openalex-snapshot
Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors
inferred← citeshttps://doi.org/10.1007/s00025-025-02479-2openalex-snapshot
Computing Shortest Paths Amid Non-overlapping Weighted Disks
inferred← citeshttps://doi.org/10.1007/s00453-014-9950-0openalex-snapshot
The Higher-Order Voronoi Diagram of Line Segments
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50025-0openalex-snapshot
Geometric Algorithms
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.dam.2008.06.019openalex-snapshot
Topological sweep of the complete graph
inferred← citeshttps://doi.org/10.1016/j.jda.2014.10.006openalex-snapshot
Range search on tuples of points
inferred← citeshttps://doi.org/10.1080/00207169608804499openalex-snapshot
An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane
inferred← citeshttps://doi.org/10.1093/comjnl/bxr076openalex-snapshot
Minimizing the Range for k-Covered Paths on Sensor Networks
inferred← citeshttps://doi.org/10.1109/isvd.2007.32openalex-snapshot
On Sweep-plane Analysis of Laguerre Voronoi Diagram
inferred← citeshttps://doi.org/10.1109/isvd.2009.20openalex-snapshot
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
inferred← citeshttps://doi.org/10.1145/100216.100260openalex-snapshot
Solving query-retrieval problems by compacting Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.14288/1.0052098openalex-snapshot
Guarantees concerning geometric objects with imprecise points
inferred← citeshttps://doi.org/10.22215/etd/2009-06397openalex-snapshot
A ubiquitous GIS: framework, services and algorithms, development
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3806openalex-snapshot
The Higher-Order Voronoi Diagram of Line Segments
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.