On the public citation graph
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
0 signed · 66 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.3160370406openalex-snapshot
On the Piano Movers' problem: IV. Various decomposable two‐dimensional motion‐planning problems
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/cpa.3160390402openalex-snapshot
Generalized voronoi diagrams for moving a ladder. I: Topological analysis
inferredcites →https://doi.org/10.1007/978-1-4612-9906-6openalex-snapshot
Geometric Topology in Dimensions 2 and 3
inferredcites →https://doi.org/10.1007/bf01840348openalex-snapshot
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
inferredcites →https://doi.org/10.1007/bf02187867openalex-snapshot
Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
inferredcites →https://doi.org/10.1016/0196-6774(85)90021-5openalex-snapshot
A “retraction” method for planning the motion of a disc
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/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
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.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
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.1002/mma.1670180105openalex-snapshot
Connectivity graphs on two‐dimensional surfaces and their application in robotics
inferred← citeshttps://doi.org/10.1007/10705474_10openalex-snapshot
Realistic Environment Models and Their Impact on the Exact Solution of the Motion Planning Problem
inferred← citeshttps://doi.org/10.1007/3-540-51683-2_25openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
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/3-540-60286-0_114openalex-snapshot
Active subsystems for CIM environments
inferred← citeshttps://doi.org/10.1007/978-1-4471-4282-9_6openalex-snapshot
Jack Schwartz and Robotics: The Roaring Eighties
inferred← citeshttps://doi.org/10.1007/978-1-4613-8997-2_26openalex-snapshot
An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space
inferred← citeshttps://doi.org/10.1007/978-3-642-13122-6_27openalex-snapshot
Simple Wriggling Is Hard Unless You Are a Fat Hippo
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/bf01258292openalex-snapshot
The complexity of the free space for motion planning amidst fat obstacles
inferred← citeshttps://doi.org/10.1007/bf01530886openalex-snapshot
On-line motion planning: Case of a planar rod
inferred← citeshttps://doi.org/10.1007/bf01530889openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
inferred← citeshttps://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferred← citeshttps://doi.org/10.1007/bf02187779openalex-snapshot
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
inferred← citeshttps://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
inferred← citeshttps://doi.org/10.1007/bf02187908openalex-snapshot
Lower bounds on moving a ladder in two and three dimensions
inferred← citeshttps://doi.org/10.1007/bf02573992openalex-snapshot
On the complexity of a single cell in certain arrangements of surfaces related to motion planning
inferred← citeshttps://doi.org/10.1007/pl00009402openalex-snapshot
Motion Planning in Environments with Low Obstacle Density
inferred← citeshttps://doi.org/10.1007/pl00009455openalex-snapshot
Motion Planning for a Convex Polygon in a Polygonal Environment
inferred← citeshttps://doi.org/10.1007/s00224-011-9337-4openalex-snapshot
Simple Wriggling is Hard Unless You Are a Fat Hippo
inferred← citeshttps://doi.org/10.1007/s004540010064openalex-snapshot
Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s10846-006-9035-7openalex-snapshot
Methodology of Concept Control Synthesis to Avoid Unmoving and Moving Obstacles (II)
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90053-7openalex-snapshot
A survey of motion planning and related geometric algorithms
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90038-1openalex-snapshot
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90026-6openalex-snapshot
Finding feasible paths for a two-point body
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90008-gopenalex-snapshot
Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90007-sopenalex-snapshot
The complexity of the free space for a robot moving amidst fat 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.1017/s089006040000250xopenalex-snapshot
Mechanization of spatial reasoning for automatic pipe layout design
inferred← citeshttps://doi.org/10.1023/a:1023926804240openalex-snapshot
Methodology of Concept Control Synthesis to Avoid Unmoving and Moving Obstacles
inferred← citeshttps://doi.org/10.1051/ita/1989230100051openalex-snapshot
Polygon placement under translation and rotation
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/ines.1997.632413openalex-snapshot
Optimal path determination for a robot in a 2D workspace using quadtree modeling
inferred← citeshttps://doi.org/10.1109/iros.1995.525859openalex-snapshot
Toward an exact incremental geometric robot motion planner
inferred← citeshttps://doi.org/10.1109/robot.1991.131911openalex-snapshot
Pipe routing-path planning (with many constraints)
inferred← citeshttps://doi.org/10.1109/robot.1993.291998openalex-snapshot
Efficient algorithms for exact motion planning amidst fat obstacles
inferred← citeshttps://doi.org/10.1109/robot.1994.351230openalex-snapshot
From spider robots to half disk robots
inferred← citeshttps://doi.org/10.1109/robot.1996.506853openalex-snapshot
A comprehensive robot collision avoidance scheme by two-dimensional geometric modeling
inferred← citeshttps://doi.org/10.1137/0221001openalex-snapshot
Efficient Motion Planning for an L -Shaped Object
inferred← citeshttps://doi.org/10.1137/s0097539797326289openalex-snapshot
Motion Planning of Legged Robots
inferred← citeshttps://doi.org/10.1142/9789812797773_0004openalex-snapshot
EFFICIENT EXACT MOTION PLANNING IN REALISTIC ENVIRONMENTS
inferred← citeshttps://doi.org/10.1145/109648.109683openalex-snapshot
On the complexity of a single cell in certain arrangements of surfaces in 3-space (extended abstract)
inferred← citeshttps://doi.org/10.1145/177424.177453openalex-snapshot
Motion planning amidst fat obstacles (extended abstract)
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/73393.73426openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1145/73393.73427openalex-snapshot
An automatic motion planning system for a convex polygonal mobile robot in 2-dimensional polygonal space
inferred← citeshttps://doi.org/10.1145/73833.73852openalex-snapshot
Efficient motion planning for an L-shaped object
inferred← citeshttps://doi.org/10.5555/1070432.1070502openalex-snapshot
Pianos are not flat: rigid motion planning in three dimensions
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.