On the public citation graph
AnO(n logn) algorithm for computing the link center of a simple polygon
0 signed · 44 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.1007/3-540-19487-8_25openalex-snapshot
Linear algorithms for graph separation problems
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/bf02187751openalex-snapshot
Computing the geodesic center of a simple polygon
inferredcites →https://doi.org/10.1007/bf02187913openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1007/bfb0028976openalex-snapshot
An O(n log n) algorithm for computing a link center in a simple polygon
inferredcites →https://doi.org/10.1016/0167-8655(86)90015-2openalex-snapshot
Shortest path solves edge-to-edge visibility in a polygon
inferredcites →https://doi.org/10.1016/0734-189x(86)90127-1openalex-snapshot
A linear time algorithm for minimum link paths inside a simple polygon
inferredcites →https://doi.org/10.1017/s0263574700009644openalex-snapshot
Separability of pairs of polygons through single translations
inferredcites →https://doi.org/10.1109/12.59852openalex-snapshot
An optimal algorithm for detecting weak visibility of a polygon
inferredcites →https://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1145/41958.41959openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1145/73833.73841openalex-snapshot
An efficient algorithm for link-distance problems
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/3-540-61422-2_139openalex-snapshot
Visibility with multiple reflections
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_30openalex-snapshot
$$\beta $$-Stars or On Extending a Drawing of a Connected Subgraph
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-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/bf01206332openalex-snapshot
Optimal parallel algorithms for rectilinear link-distance problems
inferred← citeshttps://doi.org/10.1007/bf01758855openalex-snapshot
Minimum-link paths among obstacles in the plane
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-018-0446-1openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.1007/s00454-002-2886-1openalex-snapshot
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
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.1016/0925-7721(93)90027-4openalex-snapshot
Minimal link visibility paths inside a simple polygon
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00026-7openalex-snapshot
An optimal algorithm for the rectilinear link center of a rectilinear polygon
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50013-9openalex-snapshot
Link Distance Problems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
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.2020.101685openalex-snapshot
Rectilinear link diameter and radius in a rectilinear polygonal domain
inferred← citeshttps://doi.org/10.1016/j.dam.2012.12.020openalex-snapshot
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.11.007openalex-snapshot
Settling the bound on the rectilinear link radius of a simple rectilinear polygon
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00058-xopenalex-snapshot
Optimally computing a shortest weakly visible line segment inside a simple polygon
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00003-5openalex-snapshot
Optimal on-line algorithms for walking with minimum number of turns in unknown streets
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1109/12.609280openalex-snapshot
The smallest pair of noncrossing paths in a rectilinear 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/rusautocon49822.2020.9208196openalex-snapshot
On Algorithms for the Minimum Link Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1142/s0129626499000062openalex-snapshot
SIMPLE OPTIMAL ALGORITHMS FOR RECTILINEAR LINK PATH AND POLYGON SEPARATION PROBLEMS
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/237218.237342openalex-snapshot
On the bit complexity of minimum link paths
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.65openalex-snapshot
The Visibility Center of 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.