On the public citation graph
Computing the link center of a simple polygon
0 signed · 47 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/bf01696777openalex-snapshot
Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten
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/0196-6774(81)90019-5openalex-snapshot
A linear algorithm for computing the visibility polygon from a point
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1109/tc.1981.1675729openalex-snapshot
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
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-55706-7_10openalex-snapshot
Parallel algorithms for all minimum link paths and link center problems
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-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1007/bf01206332openalex-snapshot
Optimal parallel algorithms for rectilinear link-distance problems
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/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/bf02570717openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
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/pl00009378openalex-snapshot
Visibility with Multiple Reflections
inferred← citeshttps://doi.org/10.1007/s00453-015-0031-9openalex-snapshot
Diffuse Reflection Radius in a Simple Polygon
inferred← citeshttps://doi.org/10.1016/0020-0255(94)90060-4openalex-snapshot
Geodesic convexity in discrete spaces
inferred← citeshttps://doi.org/10.1016/0166-218x(96)80467-7openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90010-copenalex-snapshot
On rectilinear link distance
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.dam.2012.12.020openalex-snapshot
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
inferred← citeshttps://doi.org/10.1016/j.dam.2013.01.018openalex-snapshot
On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane
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/j.tcs.2021.03.022openalex-snapshot
Helly-gap of a graph and vertex eccentricities
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/s0925-7721(97)00021-7openalex-snapshot
Visibility with multiple diffuse reflections
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1090/s0002-9939-1992-1089402-6openalex-snapshot
Illumination for unions of boxes in 𝑅^{𝑑}
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/12.609280openalex-snapshot
The smallest pair of noncrossing paths in a rectilinear polygon
inferred← citeshttps://doi.org/10.1109/5.163405openalex-snapshot
Scanning the issue - Computational geometry (special issue intro.)
inferred← citeshttps://doi.org/10.1109/70.88124openalex-snapshot
On some link distance problems 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.1142/s0218195900000103openalex-snapshot
An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
inferred← citeshttps://doi.org/10.1145/109648.109654openalex-snapshot
Shortest path queries in rectilinear worlds of higher dimension (extended abstract)
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/177424.178040openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
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/73833.73841openalex-snapshot
An efficient algorithm for link-distance problems
inferred← citeshttps://doi.org/10.3745/kipsta.2002.9a.4.595openalex-snapshot
An algorithm for finding a watchman route with minimum links in the characteristic polygons
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.