On the public citation graph
An O(n log n) algorithm for computing a link center in a simple polygon
0 signed · 32 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/bfb0035855openalex-snapshot
An optimal algorithm for detecting weak visibility of a 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.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/12.59852openalex-snapshot
An optimal algorithm for detecting weak visibility of a polygon
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/41958.41965openalex-snapshot
The all-geodesic furthest neighbor problem for simple polygons
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-52846-6_91openalex-snapshot
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_10openalex-snapshot
Parallel algorithms for all minimum link paths and link center problems
inferred← citeshttps://doi.org/10.1007/978-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1007/bf01758855openalex-snapshot
Minimum-link paths among obstacles in the plane
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/bfb0028267openalex-snapshot
An optimal algorithm for the rectilinear link center of a rectilinear polygon
inferred← citeshttps://doi.org/10.1007/bfb0028268openalex-snapshot
Geometric searching and link distance
inferred← citeshttps://doi.org/10.1007/bfb0028272openalex-snapshot
On bends and lengths of rectilinear paths: A graph-theoretic approach
inferred← citeshttps://doi.org/10.1007/pl00009378openalex-snapshot
Visibility with Multiple Reflections
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.1016/0925-7721(91)90010-copenalex-snapshot
On rectilinear link distance
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00021-7openalex-snapshot
Visibility with multiple diffuse reflections
inferred← citeshttps://doi.org/10.1109/12.286304openalex-snapshot
On bends and distances of paths among obstacles in two-layer interconnection model
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/ipps.1993.262857openalex-snapshot
Parallel algorithms for rectilinear link distance problems
inferred← citeshttps://doi.org/10.1109/rusautocon49822.2020.9208196openalex-snapshot
On Algorithms for the Minimum Link Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1145/73833.73841openalex-snapshot
An efficient algorithm for link-distance problems
inferred← citeshttps://doi.org/10.22215/etd/2016-11514openalex-snapshot
On Proximity Problems In Euclidean Spaces
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.