On the public citation graph

Geometric searching and link distance

https://doi.org/10.1007/bfb0028268
0 signed · 29 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02187714openalex-snapshot
Rectilinear shortest paths in the presence of rectangular barriers
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/0196-6774(87)90024-1openalex-snapshot
Dynamic orthogonal segment intersection search
inferredcites →https://doi.org/10.1016/0734-189x(86)90070-8openalex-snapshot
A linear time algorithm for minimum link paths inside a simple 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.1109/70.88124openalex-snapshot
On some link distance problems in a simple polygon
inferredcites →https://doi.org/10.1109/sfcs.1987.6openalex-snapshot
An output sensitive algorithm for computing visibility graphs
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215033openalex-snapshot
Efficient Algorithms for Geometric Graph Search Problems
inferredcites →https://doi.org/10.1145/357337.357341openalex-snapshot
Triangulating Simple Polygons and Equivalent Problems
inferredcites →https://doi.org/10.1145/41958.41959openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1145/41958.41985openalex-snapshot
Rectilinear shortest paths through polygonal obstacles in O ( n (log n ) 2 ) time
inferredcites →https://doi.org/10.1145/73393.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferredcites →https://doi.org/10.1145/73833.73841openalex-snapshot
An efficient algorithm for link-distance problems
inferredcites →https://doi.org/10.1145/98524.98537openalex-snapshot
Minimum-link paths among obstacles in the plane

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-56503-5_29openalex-snapshot
Rectilinear path queries in a simple rectilinear polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_56openalex-snapshot
Faster Algorithms for Minimum-Link Paths with Restricted Orientations
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_77openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
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-019-00112-yopenalex-snapshot
Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
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/j.comgeo.2013.12.005openalex-snapshot
Minimum-link paths revisited
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101858openalex-snapshot
Minimum-link shortest paths for polygons amidst rectilinear obstacles
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.1109/12.286304openalex-snapshot
On bends and distances of paths among obstacles in two-layer interconnection model
inferred← citeshttps://doi.org/10.22215/etd/2016-11226openalex-snapshot
Discrete Geometric Path Analysis in Computational Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1302.3091openalex-snapshot
Minimum-Link Paths Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06842openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1703.04466openalex-snapshot
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
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.