On the public citation graph
Minimum-link paths among obstacles in the plane
0 signed · 79 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/bf01937271openalex-snapshot
Corrections to Lee's visibility polygon algorithm
inferredcites →https://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferredcites →https://doi.org/10.1007/bf02187913openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1007/bf02293040openalex-snapshot
AnO(n logn) algorithm for computing the link center of a simple polygon
inferredcites →https://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
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/0020-0190(88)90203-7openalex-snapshot
A tight lower bound for the complexity of path-planning for a disc
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/0734-189x(83)90065-8openalex-snapshot
Visibility of 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/sfcs.1987.1openalex-snapshot
A new algebraic method for robot motion planning and real geometry
inferredcites →https://doi.org/10.1109/sfcs.1987.42openalex-snapshot
New lower bound techniques for robot motion planning problems
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0220055openalex-snapshot
An Output-Sensitive Algorithm for Computing Visibility Graphs
inferredcites →https://doi.org/10.1145/10515.10517openalex-snapshot
Worst-case optimal algorithms for constructing visibility polygons with holes
inferredcites →https://doi.org/10.1145/147508.147511openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
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
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
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.1002/net.3230260412openalex-snapshot
Encoding shortest paths in spatial networks
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_9openalex-snapshot
Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_64openalex-snapshot
On geometric path query problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_47openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_10openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_28openalex-snapshot
The Complexity of Drawing a Graph in a Polygonal Region
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_9openalex-snapshot
Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot
inferred← citeshttps://doi.org/10.1007/978-3-540-74782-6_40openalex-snapshot
Real-Time Trajectory Generation for Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_5openalex-snapshot
Algorithms for Computing Diffuse Reflection Paths in Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-34203-5_17openalex-snapshot
Taxonomy of Navigation for First Responders
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/s00371-011-0670-zopenalex-snapshot
Algorithms for computing diffuse reflection paths in polygons
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.1007/s10479-005-2037-1openalex-snapshot
A Wavefront Approach to Center Location Problems with Barriers
inferred← citeshttps://doi.org/10.1016/0166-218x(96)80467-7openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50013-9openalex-snapshot
Link Distance Problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.04.004openalex-snapshot
Link distance and shortest path problems in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.12.005openalex-snapshot
Minimum-link paths revisited
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101795openalex-snapshot
Structured discrete shape approximation: Theoretical complexity and practical algorithm
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.09.034openalex-snapshot
A linear time algorithm for minimum conic link path in 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.1093/comjnl/bxab200openalex-snapshot
Single-Point And Triple-Point Queries Visibility Constrained Minimum Link Paths In Simple Polygons
inferred← citeshttps://doi.org/10.1109/icsmc.1997.625782openalex-snapshot
Minimum turns/shortest path problems: a framed-subspace approach
inferred← citeshttps://doi.org/10.1109/iecon.1998.724067openalex-snapshot
Motion-planning for welding robots
inferred← citeshttps://doi.org/10.1109/rusautocon49822.2020.9208196openalex-snapshot
On Algorithms for the Minimum Link Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267794openalex-snapshot
Computing a shortest k-link path in a polygon
inferred← citeshttps://doi.org/10.1109/sice.2006.315424openalex-snapshot
A Practical Roadmap for the Path Planning of Mobile Robots in Rectilinear Environments
inferred← citeshttps://doi.org/10.1109/tce.2007.381724openalex-snapshot
A Practical Path Planner for the Robotic Vacuum Cleaner in Rectilinear Environments
inferred← citeshttps://doi.org/10.1109/tro.2007.900636openalex-snapshot
Localization With Limited Sensing
inferred← citeshttps://doi.org/10.1109/visual.1995.480813openalex-snapshot
Automatic generation of triangular irregular networks using greedy cuts
inferred← citeshttps://doi.org/10.1115/1.3615687openalex-snapshot
On Minimum Link Monotone Path Problems
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch82openalex-snapshot
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
inferred← citeshttps://doi.org/10.1142/s0218195901000651openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 42
inferred← citeshttps://doi.org/10.1142/s0218195901000675openalex-snapshot
ON GEOMETRIC PATH QUERY PROBLEMS
inferred← citeshttps://doi.org/10.1145/237218.237342openalex-snapshot
On the bit complexity of minimum link paths
inferred← citeshttps://doi.org/10.1145/237218.237403openalex-snapshot
Monotonicity of rectilinear geodesics in d-space (extended abstract)
inferred← citeshttps://doi.org/10.1145/3230650openalex-snapshot
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
inferred← citeshttps://doi.org/10.1609/socs.v4i1.18298openalex-snapshot
Planning Paths with Fewer Turns on Grid Maps
inferred← citeshttps://doi.org/10.20382/jocg.v6i1a14openalex-snapshot
A new algorithm for computing visibility graphs of polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.20382/jocg.v7i2a5openalex-snapshot
Shortest Path to a Segment and Quickest Visibility Queries
inferred← citeshttps://doi.org/10.20382/jocg.v8i2a5openalex-snapshot
On the Complexity of Minimum-Link Path Problems
inferred← citeshttps://doi.org/10.22215/etd/2016-11226openalex-snapshot
Discrete Geometric Path Analysis in Computational Geometry
inferred← citeshttps://doi.org/10.2514/6.2010-8292openalex-snapshot
A Sectorization Method for Dynamic Airspace Configuration
inferred← citeshttps://doi.org/10.3233/fi-2021-2075openalex-snapshot
Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons
inferred← citeshttps://doi.org/10.34917/2754351openalex-snapshot
Turn Constrained Path Planning Problems
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
inferred← citeshttps://doi.org/10.48550/arxiv.2005.06672openalex-snapshot
Approximating The p-Mean Curve of Large Data-Sets
inferred← citeshttps://doi.org/10.48550/arxiv.2102.11478openalex-snapshot
Mathematical Properties of Generalized Shape Expansion-Based Motion Planning Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0108021openalex-snapshot
Computational Geometry Column 42
inferred← citeshttps://doi.org/10.52547/ijmsi.17.2.235openalex-snapshot
Single-Point Visibility Constraint Minimum Link Paths in Simple 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.