On the public citation graph
Shortest paths for line segments
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.
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/cpa.3160360305openalex-snapshot
On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers
inferredcites →https://doi.org/10.1007/978-3-662-11499-5openalex-snapshot
Die innere Geometrie der metrischen Räume
inferredcites →https://doi.org/10.1007/bf01171101openalex-snapshot
On Kakeya's problem and a similar one
inferredcites →https://doi.org/10.1007/bf01840372openalex-snapshot
Optimal piecewise linear motion of an object among obstacles
inferredcites →https://doi.org/10.1007/bf02579761openalex-snapshot
Jahresbericht der Deutschen Mathematikervereinigung
inferredcites →https://doi.org/10.1016/0020-0190(89)90042-2openalex-snapshot
A note on the papadimitriou-silverberg algorithm for planning optimal piecewise-linear motion of a ladder
inferredcites →https://doi.org/10.1080/0025570x.1973.11976269openalex-snapshot
The Minimum Path and the Minimum Motion of a Moved Line Segment
inferredcites →https://doi.org/10.1109/sfcs.1985.65openalex-snapshot
Visibility-polygon search and euclidean shortest paths
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_28openalex-snapshot
Shortest Coordinated Motion for Square Robots
inferred← citeshttps://doi.org/10.1007/bf02526032openalex-snapshot
Time-optimal trajectories of a rod in the plane subject to velocity constraints
inferred← citeshttps://doi.org/10.1007/s00454-003-2952-3openalex-snapshot
Pseudo Approximation Algorithms with Applications to Optimal Motion Planning
inferred← citeshttps://doi.org/10.1007/s10514-025-10198-4openalex-snapshot
Shortest coordinated motions for square robots
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1017/cbo9780511546877.009openalex-snapshot
Extensions of Basic Motion Planning
inferred← citeshttps://doi.org/10.1080/00207160600847787openalex-snapshot
An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739398openalex-snapshot
Further results on the minimum bi-path length for rigid objects with dual steering. Solution to a problem posed by Ulam
inferred← citeshttps://doi.org/10.1117/12.25506openalex-snapshot
Algorithmic approaches to optimal route planning
inferred← citeshttps://doi.org/10.1142/s0129065797000550openalex-snapshot
Motion Planning with Complete Knowledge Using a Colored Som
inferred← citeshttps://doi.org/10.1145/160985.161012openalex-snapshot
Optimal motion planning for a rod in the plane subject to velocity constraints
inferred← citeshttps://doi.org/10.1145/237218.237394openalex-snapshot
d 1 -optimal motion for a rod (extended abstract)
inferred← citeshttps://doi.org/10.1145/513400.513422openalex-snapshot
Pseudo approximation algorithms, with applications to optimal motion planning
inferred← citeshttps://doi.org/10.22215/etd/2024-16080openalex-snapshot
Shortest Path Problems in Weighted Regions
inferred← citeshttps://doi.org/10.3182/20110828-6-it-1002.03122openalex-snapshot
On Ulam's Problem of Path Planning, and “How to Move Heavy Furniture”
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.