On the public citation graph
Computing the geodesic center of a simple polygon
0 signed · 96 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/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(84)90014-0openalex-snapshot
An O(n) algorithm for the linear multiple choice knapsack problem and related problems
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/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1109/sfcs.1982.74openalex-snapshot
Linear-time algorithms for linear programming in R3 and related problems
inferredcites →https://doi.org/10.1137/0212052openalex-snapshot
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
inferredcites →https://doi.org/10.1137/0213003openalex-snapshot
Linear Time Algorithms for Two- and Three-Variable Linear Programs
inferredcites →https://doi.org/10.1137/0215052openalex-snapshot
On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
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/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/41958.41959openalex-snapshot
Computing the link center of a simple polygon
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-58218-5_30openalex-snapshot
Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_36openalex-snapshot
Most Vital Segment Barriers
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_11openalex-snapshot
The Polygon Burning Problem
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-319-08783-2_21openalex-snapshot
Diffuse Reflection Radius in a Simple Polygon
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-15775-2_43openalex-snapshot
The Geodesic Diameter of Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_11openalex-snapshot
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-83069-3_24openalex-snapshot
Computational Geometry: Recent Results Relevant to Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_27openalex-snapshot
The 2-Center Problem in a Simple Polygon
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/978-94-009-3757-4_47openalex-snapshot
Computational Geometry and Morphology
inferred← citeshttps://doi.org/10.1007/bf01225680openalex-snapshot
Multiple-guard kernels of simple polygons
inferred← citeshttps://doi.org/10.1007/bf01553882openalex-snapshot
On the geodesic voronoi diagram of point sites in a simple polygon
inferred← citeshttps://doi.org/10.1007/bf02189321openalex-snapshot
The furthest-site geodesic voronoi diagram
inferred← citeshttps://doi.org/10.1007/bf02247961openalex-snapshot
Computing the external geodesic diameter of a simple polygon
inferred← citeshttps://doi.org/10.1007/bf02293040openalex-snapshot
AnO(n logn) algorithm for computing the link center of a simple polygon
inferred← citeshttps://doi.org/10.1007/bfb0028271openalex-snapshot
Parametric search and locating supply centers in trees
inferred← citeshttps://doi.org/10.1007/bfb0028976openalex-snapshot
An O(n log n) algorithm for computing a link center in a simple polygon
inferred← citeshttps://doi.org/10.1007/s00453-015-0031-9openalex-snapshot
Diffuse Reflection Radius in a Simple Polygon
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-01041-8openalex-snapshot
Clique-Based Separators for Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/s00453-024-01245-0openalex-snapshot
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00453-024-01267-8openalex-snapshot
On Flipping the Fréchet Distance
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-016-9841-zopenalex-snapshot
Computing the $$L_1$$ Geodesic Diameter and Center of a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/s00454-017-9872-0openalex-snapshot
Packing and Covering with Balls on Busemann Surfaces
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.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/0022-0000(89)90045-7openalex-snapshot
Computing geodesic furthest neighbors in simple polygons
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90063-3openalex-snapshot
Computing external farthest neighbors for a simple polygon
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.cad.2011.09.002openalex-snapshot
Extended grassfire transform on medial axes of 2D shapes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.02.005openalex-snapshot
Computing the L1 geodesic diameter and center of a simple polygon in linear time
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.10.009openalex-snapshot
Computing the geodesic centers of a polygonal domain
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/j.comgeo.2021.101774openalex-snapshot
Piercing pairwise intersecting geodesic disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101947openalex-snapshot
Piercing pairwise intersecting geodesic disks by five points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102209openalex-snapshot
Piercing unit geodesic disks
inferred← citeshttps://doi.org/10.1016/j.media.2020.101711openalex-snapshot
Groupwise registration with global-local graph shrinkage in atlas construction
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/s0166-218x(99)00248-6openalex-snapshot
Centers of sets of pixels
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.1090/tran/9301openalex-snapshot
Point selections from Jordan domains in Riemannian surfaces
inferred← citeshttps://doi.org/10.1097/00001756-200501190-00003openalex-snapshot
Positioning of retinotopic areas and patterning of cerebral cortex layout
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/tvcg.2010.89openalex-snapshot
Point-Based Visualization for Large Hierarchies
inferred← citeshttps://doi.org/10.1111/cgf.13000openalex-snapshot
Spatial Matching of Animated Meshes
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/s0218195910003499openalex-snapshot
PARETO ENVELOPES IN SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195911003822openalex-snapshot
GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON
inferred← citeshttps://doi.org/10.1145/1377676.1377687openalex-snapshot
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
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/336154.336182openalex-snapshot
On the continuous Weber and k -median problems (extended abstract)
inferred← citeshttps://doi.org/10.1145/378583.378657openalex-snapshot
Farthest neighbors and center points in the presence of rectngular obstacles
inferred← citeshttps://doi.org/10.1145/41958.41959openalex-snapshot
Computing the link center of a simple polygon
inferred← citeshttps://doi.org/10.1145/41958.41963openalex-snapshot
On the geodesic Voronoi diagram of point sites in a simple polygon
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.1287/opre.1040.0137openalex-snapshot
On the Continuous Fermat-Weber Problem
inferred← citeshttps://doi.org/10.20382/jocg.v9i1a5openalex-snapshot
On the Geodesic Centers of Polygonal Domains
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.22215/etd/2024-16080openalex-snapshot
Shortest Path Problems in Weighted Regions
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.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.1402.5303openalex-snapshot
Diffuse Reflection Radius in a Simple Polygon
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.1509.07214openalex-snapshot
Computing the Geodesic Centers of a Polygonal Domain
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11260openalex-snapshot
A Time-space Trade-off for Computing 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.