On the public citation graph
Optimal piecewise linear motion of an object among obstacles
0 signed · 40 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.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.1002/net.3230110307openalex-snapshot
Finding minimum rectilinear distance paths in the presence of barriers
inferredcites →https://doi.org/10.1007/978-1-4613-8997-2_22openalex-snapshot
Solving the Find-Path Problem by Good Representation of Free Space
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0020-0190(85)90029-8openalex-snapshot
An algorithm for shortest-path motion in three dimensions
inferredcites →https://doi.org/10.1109/sfcs.1979.10openalex-snapshot
Complexity of the mover's problem and generalizations
inferredcites →https://doi.org/10.1109/sfcs.1984.715934openalex-snapshot
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
inferredcites →https://doi.org/10.1109/sfcs.1985.40openalex-snapshot
On minima of function, intersection patterns of curves, and davenport-schinzel sequences
inferredcites →https://doi.org/10.1109/sfcs.1985.65openalex-snapshot
Visibility-polygon search and euclidean shortest paths
inferredcites →https://doi.org/10.1109/tsmc.1983.6313112openalex-snapshot
Solving the find-path problem by good representation of free space
inferredcites →https://doi.org/10.1117/12.943180openalex-snapshot
An Autonomous Vehicle Navigation Algorithm
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/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1145/800057.808676openalex-snapshot
On shortest paths in polyhedral spaces
inferredcites →https://doi.org/10.1177/027836498300200304openalex-snapshot
On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers
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-1-4615-2836-4_5openalex-snapshot
Feature Based, Collision Free Inspection Path Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/bf01928918openalex-snapshot
Visibility graphs and obstacle-avoiding shortest paths
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.1016/0004-3702(88)90054-9openalex-snapshot
An algorithmic approach to some problems in terrain navigation
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90083-5openalex-snapshot
Characterizing the shortest path of an object among obstacles
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50013-8openalex-snapshot
Algorithmic Motion Planning in Robotics
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.apor.2015.01.019openalex-snapshot
An approach for development of a ship routing algorithm for application in the North Indian Ocean region
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
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/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1117/12.25506openalex-snapshot
Algorithmic approaches to optimal route planning
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.1287/opre.38.3.426openalex-snapshot
Deterministic Minimal Time Vessel Routing
inferred← citeshttps://doi.org/10.1287/trsc.23.4.266openalex-snapshot
Minimal Time Vessel Routing in a Time-Dependent Environment
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.