On the public citation graph

A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains

https://doi.org/10.1007/pl00009199
0 signed · 56 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.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/bf01553882openalex-snapshot
On the geodesic voronoi diagram of point sites in a simple polygon
inferredcites →https://doi.org/10.1007/bf01758836openalex-snapshot
L 1 shortest paths among polygonal obstacles in the plane
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/bf02523193openalex-snapshot
Proximity problems for points on a rectilinear plane with rectangular obstacles
inferredcites →https://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1993.366836openalex-snapshot
Efficient computation of Euclidean shortest paths in the plane
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/s0097539795285916openalex-snapshot
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
inferredcites →https://doi.org/10.1142/s0218195996000216openalex-snapshot
SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
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/41958.41982openalex-snapshot
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
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/978-0-387-87363-3_19openalex-snapshot
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_2openalex-snapshot
Geodesic-Preserving Polygon Simplification
inferred← citeshttps://doi.org/10.1007/s00453-018-00540-xopenalex-snapshot
Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane
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/s00454-006-1249-0openalex-snapshot
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
inferred← citeshttps://doi.org/10.1007/s00454-008-9052-3openalex-snapshot
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
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/j.aei.2014.06.004openalex-snapshot
Operations on network-based space layouts for modeling multiple space views of buildings
inferred← citeshttps://doi.org/10.1016/j.cad.2013.04.004openalex-snapshot
Structure and spatial consistency of network-based space layouts for building and product design
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.05.001openalex-snapshot
Computing a geodesic two-center of points in a simple polygon
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.ijmachtools.2004.06.012openalex-snapshot
A geometric approach for injection mould filling simulation
inferred← citeshttps://doi.org/10.1016/j.trc.2018.02.017openalex-snapshot
A range-restricted recharging station coverage model for drone delivery service planning
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00256-6openalex-snapshot
Short trees in polygons
inferred← citeshttps://doi.org/10.1080/13658816.2013.788182openalex-snapshot
Efficient measurement of continuous space shortest distance around barriers
inferred← citeshttps://doi.org/10.1080/15481603.2023.2171703openalex-snapshot
Exact Voronoi diagram for topographic spatial analysis
inferred← citeshttps://doi.org/10.1109/csae.2012.6272552openalex-snapshot
A heuristic algorithm for Euclidean Steiner Minimal Tree inside simple polygon
inferred← citeshttps://doi.org/10.1109/iccsa.2007.38openalex-snapshot
An alternative distribution model for the Molecular Dynamics study of liquid Propane on a grid platform
inferred← citeshttps://doi.org/10.1109/iccsa.2007.83openalex-snapshot
Euclidean Steiner Minimal Tree Inside Simple Polygon Avoiding 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/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.38openalex-snapshot
Time Convex Hull with a Highway
inferred← citeshttps://doi.org/10.1109/tac.2015.2409903openalex-snapshot
Distributed Collaborative Coverage-Control Schemes for Non-Convex Domains
inferred← citeshttps://doi.org/10.1109/tcad.2012.2185050openalex-snapshot
Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm
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/s0218195914600097openalex-snapshot
GEODESIC-PRESERVING POLYGON SIMPLIFICATION
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/1868237.1868247openalex-snapshot
Geodesic Fréchet distance inside a simple polygon
inferred← citeshttps://doi.org/10.1145/2533828.2533834openalex-snapshot
Efficient wayfinding in complex environments
inferred← citeshttps://doi.org/10.1145/997817.997822openalex-snapshot
Separating point sets in polygonal environments
inferred← citeshttps://doi.org/10.1201/9781584888215-c2openalex-snapshot
Computational Geometry II
inferred← citeshttps://doi.org/10.22215/etd/2009-06397openalex-snapshot
A ubiquitous GIS: framework, services and algorithms, development
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.1707.02961openalex-snapshot
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1910.12177openalex-snapshot
Computing a Geodesic Two-Center of Points in a Simple Polygon
inferred← citeshttps://doi.org/10.70675/68b5a8bdz7f36z4af2z9c34z21df4383d05fopenalex-snapshot
Morphologie mathématique appliquée au développement d'outils de maillage EF automatiques dans le cas de microstructures hétérogènes bi et multiphasées
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.