On the public citation graph
Motion Planning in Environments with Low Obstacle Density
0 signed · 71 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.1006/jagm.1996.0063openalex-snapshot
Range Searching and Point Location among Fat Objects
inferredcites →https://doi.org/10.1007/3-540-51683-2_25openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
inferredcites →https://doi.org/10.1007/3-540-58218-5_1openalex-snapshot
Computing depth orders and related problems
inferredcites →https://doi.org/10.1007/3-540-60313-1_148openalex-snapshot
Linear size binary space partitions for fat objects
inferredcites →https://doi.org/10.1007/3-540-63307-3_44openalex-snapshot
Dynamic motion planning in low obstacle density environments
inferredcites →https://doi.org/10.1007/bf01258292openalex-snapshot
The complexity of the free space for motion planning amidst fat obstacles
inferredcites →https://doi.org/10.1007/bf01758853openalex-snapshot
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
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.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
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.1007/bf02187883openalex-snapshot
On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1016/0020-0190(92)90211-dopenalex-snapshot
Point location in fat subdivisions
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-6774(87)90038-1openalex-snapshot
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
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.1016/0925-7721(92)90024-mopenalex-snapshot
Efficient hidden surface removal for objects with small union size
inferredcites →https://doi.org/10.1016/0925-7721(93)90007-sopenalex-snapshot
The complexity of the free space for a robot moving amidst fat obstacles
inferredcites →https://doi.org/10.1016/0925-7721(93)90018-2openalex-snapshot
On the union of fat wedges and separating a collection of segments by a line
inferredcites →https://doi.org/10.1016/0925-7721(95)00005-8openalex-snapshot
Computing depth orders for fat objects and related problems
inferredcites →https://doi.org/10.1016/s0925-7721(96)00016-8openalex-snapshot
On fat partitioning, fat covering and the union size of polygons
inferredcites →https://doi.org/10.1016/s0925-7721(97)00008-4openalex-snapshot
New results on binary space partitions in the plane
inferredcites →https://doi.org/10.1016/s0925-7721(98)00026-1openalex-snapshot
Dynamic motion planning in low obstacle density environments
inferredcites →https://doi.org/10.1109/robot.1987.1087897openalex-snapshot
Efficient algorithms for planning purely translational collision-free motion in two and three dimensions
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1137/0213031openalex-snapshot
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
inferredcites →https://doi.org/10.1137/s009753979018330xopenalex-snapshot
Fat Triangles Determine Linearly Many Holes
inferredcites →https://doi.org/10.1145/177424.177427openalex-snapshot
Vertical decompositions for triangles in 3-space
inferredcites →https://doi.org/10.1145/177424.177574openalex-snapshot
Spheres, molecules, and hidden surface removal
inferredcites →https://doi.org/10.1145/262839.262986openalex-snapshot
Realistic input models for geometric algorithms
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/41958.41972openalex-snapshot
Moving a ladder in three dimensions: upper and lower bounds
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.1006/cviu.1996.0041openalex-snapshot
Image Analysis and Computer Vision: 1995
inferred← citeshttps://doi.org/10.1006/cviu.1999.0746openalex-snapshot
Image Analysis and Computer Vision: 1998
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-47789-6_11openalex-snapshot
Collision Detection Optimization in a Multi-particle System
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_44openalex-snapshot
Dynamic motion planning in low obstacle density environments
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_5openalex-snapshot
Connect the Dot: Computing Feed-Links with Minimum Dilation
inferred← citeshttps://doi.org/10.1007/978-3-642-36279-8_3openalex-snapshot
Robust Complete Path Planning in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_60openalex-snapshot
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
inferred← citeshttps://doi.org/10.1007/pl00009476openalex-snapshot
Motion Planning for Multiple Robots
inferred← citeshttps://doi.org/10.1007/s00453-002-0961-xopenalex-snapshot
Realistic Input Models for Geometric Algorithms
inferred← citeshttps://doi.org/10.1007/s004530010047openalex-snapshot
Linear Size Binary Space Partitions for Uncluttered Scenes
inferred← citeshttps://doi.org/10.1007/s00454-009-9136-8openalex-snapshot
An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra
inferred← citeshttps://doi.org/10.1007/s10514-018-9728-3openalex-snapshot
Goal state driven trajectory optimization
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.01.004openalex-snapshot
Exact and approximation algorithms for computing optimal fat decompositions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.03.004openalex-snapshot
Box-trees for collision checking in industrial installations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101920openalex-snapshot
Approximating the packedness of polygonal curves
inferred← citeshttps://doi.org/10.1016/j.paerosci.2018.07.001openalex-snapshot
Obstacle avoidance in space robotics: Review of major challenges and proposed solutions
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00022-0openalex-snapshot
Models and motion planning
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00026-1openalex-snapshot
Dynamic motion planning in low obstacle density environments
inferred← citeshttps://doi.org/10.1023/a:1026231624387openalex-snapshot
A New Cell-subdivision Approach to Plan Free Translations in Cluttered Environments
inferred← citeshttps://doi.org/10.1109/iros.2005.1545603openalex-snapshot
Path planning for pushing a disk using compliance
inferred← citeshttps://doi.org/10.1137/16m1079336openalex-snapshot
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
inferred← citeshttps://doi.org/10.1145/1247069.1247081openalex-snapshot
Shortest paths on realistic polyhedra
inferred← citeshttps://doi.org/10.1145/1569901.1570203openalex-snapshot
A genetic algorithm with local map for path planning in dynamic environments
inferred← citeshttps://doi.org/10.1145/262839.262986openalex-snapshot
Realistic input models for geometric algorithms
inferred← citeshttps://doi.org/10.1145/276884.276926openalex-snapshot
Motion planning for multiple robots
inferred← citeshttps://doi.org/10.1145/513400.513407openalex-snapshot
Box-trees for collision checking in industrial installations
inferred← citeshttps://doi.org/10.48550/arxiv.1209.3954openalex-snapshot
How Many Potatoes are in a Mesh?
inferred← citeshttps://doi.org/10.5311/josis.2011.3.47openalex-snapshot
Connect the dot: Computing feed-links for network extension
inferred← citeshttps://doi.org/10.6100/ir761554openalex-snapshot
Realistic analysis for algorithmic problems on geographical data
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.