On the public citation graph
On the geodesic voronoi diagram of point sites in a simple polygon
0 signed · 101 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.1002/cpa.3160390402openalex-snapshot
Generalized voronoi diagrams for moving a ladder. I: Topological analysis
inferredcites →https://doi.org/10.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1007/bf01553881openalex-snapshot
Constrained delaunay triangulations
inferredcites →https://doi.org/10.1007/bf01840348openalex-snapshot
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02187695openalex-snapshot
Generalized delaunay triangulation for planar graphs
inferredcites →https://doi.org/10.1007/bf02187751openalex-snapshot
Computing the geodesic center of a simple polygon
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/bf02187913openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
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/b978-0-12-386870-1.50009-5openalex-snapshot
Voronoi Diagram for Points in a Simple Polygon
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
inferredcites →https://doi.org/10.1137/0214006openalex-snapshot
Voronoi Diagram in the Laguerre Geometry and Its Applications
inferredcites →https://doi.org/10.1137/0216006openalex-snapshot
Power Diagrams: Properties, Algorithms and Applications
inferredcites →https://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
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/41958.41959openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1145/41958.41965openalex-snapshot
The all-geodesic furthest neighbor problem for simple polygons
inferredcites →https://doi.org/10.1145/41958.41982openalex-snapshot
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
inferredcites →https://doi.org/10.1145/42282.214094openalex-snapshot
On the shortest paths between two convex polyhedra
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/73393.73417openalex-snapshot
The furthest-site geodesic Voronoi diagram
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-57529-4_55openalex-snapshot
Proximity problems and the Voronoi diagram on a rectilinear plane with rectangular obstacles
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_366openalex-snapshot
Visibility graphs and oriented matroids (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_147openalex-snapshot
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_13openalex-snapshot
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_5openalex-snapshot
Voronoi Diagram in the Flow Field
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_24openalex-snapshot
Approximation of the Boat-Sail Voronoi Diagram and Its Application
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_57openalex-snapshot
Geodesic Disks and Clustering in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_2openalex-snapshot
Geodesic-Preserving Polygon Simplification
inferred← citeshttps://doi.org/10.1007/bf01530888openalex-snapshot
A new algorithm for shortest paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf02189321openalex-snapshot
The furthest-site geodesic voronoi diagram
inferred← citeshttps://doi.org/10.1007/bf02523193openalex-snapshot
Proximity problems for points on a rectilinear plane with rectangular obstacles
inferred← citeshttps://doi.org/10.1007/bf02570717openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
inferred← citeshttps://doi.org/10.1007/bf03167442openalex-snapshot
Boat-Sail Voronoi diagram on a curved surface
inferred← citeshttps://doi.org/10.1007/bf03167490openalex-snapshot
Boat-sail Voronoi diagram and its computation based on a cone-approximation scheme
inferred← citeshttps://doi.org/10.1007/pl00009199openalex-snapshot
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains
inferred← citeshttps://doi.org/10.1007/s00453-019-00624-2openalex-snapshot
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00453-022-01094-9openalex-snapshot
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles
inferred← citeshttps://doi.org/10.1007/s00454-002-2881-6openalex-snapshot
Visibility Graphs and Oriented Matroids
inferred← citeshttps://doi.org/10.1007/s00454-016-9796-0openalex-snapshot
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00454-016-9841-zopenalex-snapshot
Computing the $$L_1$$ Geodesic Diameter and Center of a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/s00454-019-00063-4openalex-snapshot
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00454-022-00424-6openalex-snapshot
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
inferred← citeshttps://doi.org/10.1016/0166-3615(95)80005-0openalex-snapshot
Application of computational geometry in optimizing 2.5D and 3D NC surface machining
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/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.cam.2006.01.035openalex-snapshot
Stable marker-particle method for the Voronoi diagram in a flow field
inferred← citeshttps://doi.org/10.1016/j.dam.2014.04.009openalex-snapshot
A note on visibility-constrained Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.ecolmodel.2010.03.019openalex-snapshot
A Voronoi diagram based population model for social species of wildlife
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.318openalex-snapshot
Computational aspects of disks enclosing many points
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00229-6openalex-snapshot
On determining optimal strategies in pursuit games in the plane
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1080/01495739808947366openalex-snapshot
OPTIMAL MESH ALGORITHMS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS*
inferred← citeshttps://doi.org/10.1080/23729333.2025.2561407openalex-snapshot
Summarizing classed region maps with a disk choreme
inferred← citeshttps://doi.org/10.1109/acc.2015.7171001openalex-snapshot
Collision avoidance for quadrotor UAVs transporting a payload via Voronoi tessellation
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739194openalex-snapshot
Sensing and coverage for a network of heterogeneous robots
inferred← citeshttps://doi.org/10.1109/icra.2011.5980415openalex-snapshot
DisCoverage for non-convex environments with arbitrary obstacles
inferred← citeshttps://doi.org/10.1109/icra.2013.6630685openalex-snapshot
Distributed coverage using geodesic metric for non-convex environments
inferred← citeshttps://doi.org/10.1109/ipps.1994.288190openalex-snapshot
An optimal mesh computer algorithm for constrained Delaunay triangulation
inferred← citeshttps://doi.org/10.1109/iros.2014.6943104openalex-snapshot
Geodesic topological voronoi tessellations in triangulated environments with multi-robot systems
inferred← citeshttps://doi.org/10.1109/iros.2016.7759650openalex-snapshot
Hierarchical coordination strategy for multi-AGV systems based on dynamic geodesic environment partitioning
inferred← citeshttps://doi.org/10.1109/isvd.2007.17openalex-snapshot
Direct Diffusion Method for the Construction of Generalized Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/isvd.2011.20openalex-snapshot
Rescue Boat Voronoi Diagrams for Inhomogeneous, Anisotropic, and Time-Varying Distances
inferred← citeshttps://doi.org/10.1109/sigra.1997.625151openalex-snapshot
Representation of conics in the oriented projective plane
inferred← citeshttps://doi.org/10.1137/20m1384804openalex-snapshot
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
inferred← citeshttps://doi.org/10.1142/s0218195905001762openalex-snapshot
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
inferred← citeshttps://doi.org/10.1142/s0218195909003052openalex-snapshot
BOAT-SAIL VORONOI DIAGRAM AND ITS APPLICATION
inferred← citeshttps://doi.org/10.1142/s0218195911003822openalex-snapshot
GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON
inferred← citeshttps://doi.org/10.1142/s0218195998000230openalex-snapshot
Polygon Area Decomposition for Multiple-Robot Workspace Division
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/126546.126548openalex-snapshot
On the Peeper's Voronoi diagram
inferred← citeshttps://doi.org/10.1145/1542362.1542402openalex-snapshot
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
inferred← citeshttps://doi.org/10.1145/177424.178040openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
inferred← citeshttps://doi.org/10.1145/73393.73417openalex-snapshot
The furthest-site geodesic Voronoi diagram
inferred← citeshttps://doi.org/10.1145/997817.997822openalex-snapshot
Separating point sets in polygonal environments
inferred← citeshttps://doi.org/10.1177/0278364915624974openalex-snapshot
Structured triangulation in multi-robot systems: Coverage, patrolling, Voronoi partitions, and geodesic centers
inferred← citeshttps://doi.org/10.22215/etd/2014-10404openalex-snapshot
Obstacle-Avoiding Path Existence Queries in a Simple Polygon
inferred← citeshttps://doi.org/10.22215/etd/2016-11514openalex-snapshot
On Proximity Problems In Euclidean Spaces
inferred← citeshttps://doi.org/10.22215/etd/2023-15445openalex-snapshot
Constrained Geometric Optimization Problems
inferred← citeshttps://doi.org/10.4230/lipics.socg.2019.12openalex-snapshot
Geodesic farthest-point Voronoi diagram in linear time
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.59openalex-snapshot
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1311.6033openalex-snapshot
Packing and Covering a Polygon with Geodesic Disks
inferred← citeshttps://doi.org/10.48550/arxiv.1501.00561openalex-snapshot
A linear-time algorithm for the geodesic center of a simple polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1707.02961openalex-snapshot
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
inferred← citeshttps://doi.org/10.5555/642136.642137openalex-snapshot
Geodesic Voronoi diagrams in the presence of rectilinear barriers
inferred← citeshttps://doi.org/10.5772/50014openalex-snapshot
Demand Allocation in Water Distribution Network Modelling – A GIS-Based Approach Using Voronoi Diagrams with Constraints
inferred← citeshttps://doi.org/10.6028/nist.ir.5164openalex-snapshot
Bibliographic notes on Voronoi diagrams
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.