The complexity of the free space for a robot moving amidst fat obstacles

DOI10.1016/0925-7721(93)90007-SzbMATH Open0801.68177OpenAlexW2134898774MaRDI QIDQ1314536FDOQ1314536

Authors: Mark H. Overmars, A. Frank van der Stappen, Dan Halperin 

Publication date: 17 February 1994

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(93)90007-s

Recommendations

• The complexity of the free space for motion planning amidst fat obstacles
• Models and motion planning
• Models and motion planning
• Motion planning in environments with low obstacle density
• scientific article; zbMATH DE number 3945381

zbMATH Keywords

computational geometrymotion planningcombinatorial complexityfree spacefatnessmultiple contacts

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• The complexity of the free space for a robot moving 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
• On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
• A “retraction” method for planning the motion of a disc
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Cited In (23)

• Contraction and expansion of convex sets
• On a class of \(O(n^2)\) problems in computational geometry
• Dynamic data structures for fat objects and their applications
• Models and motion planning
• Improved bounds on the union complexity of fat objects
• Sublinear Separators in Intersection Graphs of Convex Shapes
• Spheres, molecules, and hidden surface removal
• Range searching in low-density environments
• New results on binary space partitions in the plane
• Similarity of polygonal curves in the presence of outliers
• The complexity of the free space for a robot moving amidst fat obstacles
• Unions of fat convex polytopes have short skeletons
• Exact and approximation algorithms for computing optimal fat decompositions
• On a class of \(O(n^ 2)\) problems in computational geometry
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• On fat partitioning, fat covering and the union size of polygons
• New results on binary space partitions in the plane (extended abstract)
• The complexity of the free space for motion planning amidst fat obstacles
• Maximum matchings in geometric intersection graphs
• Sampling-Based Motion Planning for Uncertain High-Dimensional Systems via Adaptive Control
• Point location in fat subdivisions
• Median trajectories
• Models and motion planning

This page was built for publication: The complexity of the free space for a robot moving amidst fat obstacles

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