Models and motion planning

DOI10.1007/BFb0054357zbMath1502.68313OpenAlexW1949142875MaRDI QIDQ5054845

A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz, Mark T. de Berg, Mark H. Overmars

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0054357

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (2)

Guarding scenes against invasive hypercubes. ⋮ Local polyhedra and geometric graphs

Cites Work

• Unnamed Item
• Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
• Efficient hidden surface removal for objects with small union size
• Motion planning in environments with low obstacle density
• The complexity of the free space for a robot moving amidst fat obstacles
• Range searching in low-density environments
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Realistic input models for geometric algorithms
• Computing depth orders for fat objects and related problems
• On the union of \(\kappa\)-curved objects
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• Range Searching and Point Location among Fat Objects
• Fat Triangles Determine Linearly Many Holes
• Dynamic data structures for fat objects and their applications
• Linear size binary space partitions for fat objects

This page was built for publication: Models and motion planning