On the public citation graph
The furthest-site geodesic voronoi diagram
0 signed · 53 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/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
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/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferredcites →https://doi.org/10.1007/bf02187751openalex-snapshot
Computing the geodesic 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/0022-0000(89)90045-7openalex-snapshot
Computing geodesic furthest neighbors in simple polygons
inferredcites →https://doi.org/10.1016/b978-0-12-386870-1.50010-1openalex-snapshot
Computing the Geodesic Center of a Simple Polygon
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
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-44679-6_19openalex-snapshot
Finding an Optimal Bridge between Two Polygons
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-77891-2_10openalex-snapshot
Guarding Exterior Region of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_43openalex-snapshot
The Geodesic Diameter of Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_2openalex-snapshot
Geodesic-Preserving Polygon Simplification
inferred← citeshttps://doi.org/10.1007/978-3-642-45346-5_6openalex-snapshot
Polygon-Constrained Motion Planning Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_48openalex-snapshot
Computing a Geodesic Two-Center of Points in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00224-001-1018-2openalex-snapshot
Computing the Optimal Bridge between Two Polygons
inferred← citeshttps://doi.org/10.1007/s00453-019-00651-zopenalex-snapshot
The Geodesic Farthest-Point Voronoi Diagram 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-013-9527-8openalex-snapshot
The Geodesic Diameter of Polygonal Domains
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-019-00063-4openalex-snapshot
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00454-019-00110-0openalex-snapshot
$$L_1$$ Geodesic Farthest Neighbors in a Simple Polygon and Related Problems
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.1007/s00454-025-00768-9openalex-snapshot
The Geodesic Edge Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s10957-011-9868-5openalex-snapshot
Blaschke-Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets
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.comgeo.2016.05.004openalex-snapshot
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.02.008openalex-snapshot
The geodesic 2-center problem in a simple polygon
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/s0020-0190(00)00229-5openalex-snapshot
An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
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/01630561003757801openalex-snapshot
Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon
inferred← citeshttps://doi.org/10.1109/cgi.1996.511792openalex-snapshot
Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications
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.1137/20m1384804openalex-snapshot
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
inferred← citeshttps://doi.org/10.1142/s0218195902000852openalex-snapshot
FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195905001762openalex-snapshot
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
inferred← citeshttps://doi.org/10.1142/s0218195905001889openalex-snapshot
EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
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/997817.997822openalex-snapshot
Separating point sets in polygonal environments
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.esa.2021.65openalex-snapshot
The Visibility Center of a Simple Polygon
inferred← citeshttps://doi.org/10.4230/lipics.socg.2018.4openalex-snapshot
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
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.1407.0614openalex-snapshot
Covering the Boundary of a Simple Polygon with Geodesic Unit 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.1910.12177openalex-snapshot
Computing a Geodesic Two-Center of Points in a Simple Polygon
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.