The complexity of the free space for motion planning amidst fat obstacles

Computing methodologies and applications (68U99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Cites Work

Robot motion planning with uncertainty in control and sensing
The complexity of the free space for a robot moving amidst fat obstacles
Fat Triangles Determine Linearly Many Holes
The complexity of the free space for motion planning amidst fat obstacles
On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
A “retraction” method for planning the motion of a disc
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
Efficient Motion Planning for an L-Shaped Object
Point location in fat subdivisions

Cited In (29)

An optimal-time algorithm for shortest paths on realistic polyhedra
On realistic terrains
Reprint of: Bounding the locus of the center of mass for a part with shape variation
Dynamic data structures for fat objects and their applications
Models and motion planning
Improved bounds on the union complexity of fat objects
Dynamic motion planning in low obstacle density environments
Approximating the \(\lambda \)-low-density value
Range searching in low-density environments
Guarding scenes against invasive hypercubes.
Bounding the locus of the center of mass for a part with shape variation
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Walking around fat obstacles.
Unions of fat convex polytopes have short skeletons
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
Local polyhedra and geometric graphs
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
Approximate unions of lines and Minkowski sums
Kinetic collision detection for convex fat objects
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
Dynamic motion planning in low obstacle density environments
Decompositions and boundary coverings of non-convex fat polyhedra
The complexity of the free space for motion planning amidst fat obstacles
Preprocessing imprecise points for Delaunay triangulation: simplified and extended
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
Placing Text Boxes on Graphs
On the flatness of Minkowski sums
Models and motion planning

   Recommendations

The complexity of the free space for a robot moving amidst fat obstacles 👍 👎
Models and motion planning 👍 👎
Models and motion planning 👍 👎
Motion planning in environments with low obstacle density 👍 👎
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures 👍 👎

This page was built for publication: The complexity of the free space for motion planning amidst fat obstacles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1842754)