On the public citation graph

Lower bounds on moving a ladder in two and three dimensions

https://doi.org/10.1007/bf02187908
0 signed · 18 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.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.1002/cpa.3160370605openalex-snapshot
On the piano movers' problem: V. The case of a rod moving in three‐dimensional space amidst polyhedral obstacles
inferredcites →https://doi.org/10.1007/bf01840368openalex-snapshot
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/10515.10535openalex-snapshot
A new efficient motion-planning algorithm for a rod in polygonal space
inferredcites →https://doi.org/10.1145/323233.323262openalex-snapshot
An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)
inferredcites →https://doi.org/10.1145/41958.41972openalex-snapshot
Moving a ladder in three dimensions: upper and lower bounds
inferredcites →https://doi.org/10.1145/800061.808750openalex-snapshot
Retraction

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpa.3160480910openalex-snapshot
Robot motion planning
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_81openalex-snapshot
The visibility diagram: A data structure for visibility problems and motion planning
inferred← citeshttps://doi.org/10.1007/bfb0028281openalex-snapshot
Dynamically maintaining the visibility graph
inferred← citeshttps://doi.org/10.1017/cbo9780511546877.008openalex-snapshot
Combinatorial Motion Planning
inferred← citeshttps://doi.org/10.1109/34.295902openalex-snapshot
Collision detection of a moving polygon in the presence of polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1109/romoco.2019.8787364openalex-snapshot
Sensor Lattices: Structures for Comparing Information Feedback
inferred← citeshttps://doi.org/10.1137/0221001openalex-snapshot
Efficient Motion Planning for an L -Shaped Object
inferred← citeshttps://doi.org/10.1145/136035.136037openalex-snapshot
Gross motion planning—a survey
inferred← citeshttps://doi.org/10.1145/41958.41972openalex-snapshot
Moving a ladder in three dimensions: upper and lower bounds
inferred← citeshttps://doi.org/10.1145/73833.73852openalex-snapshot
Efficient motion planning for an L-shaped object
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.