On the public citation graph

3-dimensional shortest paths in the presence of polyhedral obstacles

https://doi.org/10.1007/bfb0017133
0 signed · 30 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/bfb0024013openalex-snapshot
Shortest paths on polyhedral surfaces
inferredcites →https://doi.org/10.1007/bfb0030287openalex-snapshot
Complexity of quantifier elimination in the theory of algebraically closed fields
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.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1109/sfcs.1982.29openalex-snapshot
On the movement of robot arms in 2-dimensional bounded regions
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/0213038openalex-snapshot
Movement Problems for 2-Dimensional Linkages
inferredcites →https://doi.org/10.1137/0215055openalex-snapshot
Reducing Multiple Object Motion Planning to Graph Searching
inferredcites →https://doi.org/10.1145/323233.323242openalex-snapshot
On the complexity of reachability and motion planning questions (extended abstract)
inferredcites →https://doi.org/10.1145/323233.323244openalex-snapshot
An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles
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.1145/800057.808712openalex-snapshot
The complexity of elementary algebra and geometry
inferredcites →https://doi.org/10.1145/800061.808750openalex-snapshot
Retraction
inferredcites →https://doi.org/10.1177/027836498600400403openalex-snapshot
Motion of Objects in Contact

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-17179-7_9openalex-snapshot
Shortest-path motion
inferred← citeshttps://doi.org/10.1007/3-540-57322-4_8openalex-snapshot
On mathematical modeling in robotics
inferred← citeshttps://doi.org/10.1007/978-94-011-2526-0_29openalex-snapshot
An Approach to Real-Time Flexible Path Planning
inferred← citeshttps://doi.org/10.1007/bf01530888openalex-snapshot
A new algorithm for shortest paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf01758836openalex-snapshot
L 1 shortest paths among polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf01891838openalex-snapshot
Continuous alternation: The complexity of pursuit in continuous domains
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90002-vopenalex-snapshot
Parallel rectilinear shortest paths with rectangular 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/s0165-1684(03)00191-9openalex-snapshot
Consideration of obstacle danger level in path planning using and Fast-Marching optimisation: comparative study
inferred← citeshttps://doi.org/10.1109/70.954761openalex-snapshot
Autonomous vehicle navigation utilizing electrostatic potential fields and fuzzy logic
inferred← citeshttps://doi.org/10.1142/s0218195996000095openalex-snapshot
SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
inferred← citeshttps://doi.org/10.1145/136035.136037openalex-snapshot
Gross motion planning—a survey
inferred← citeshttps://doi.org/10.1177/027836498700600203openalex-snapshot
Identification of Partially Obscured Objects in Two and Three Dimensions by Matching Noisy Characteristic Curves
inferred← citeshttps://doi.org/10.3390/ijgi9060353openalex-snapshot
Accurate and Efficient Calculation of Three-Dimensional Cost Distance
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.