Models and motion planning

DOI10.1007/BFB0054357zbMATH Open1502.68313OpenAlexW1949142875MaRDI QIDQ5054845FDOQ5054845

Authors: A. Frank van der Stappen, Jules Vleugels, Mark de Berg, Matthew J. Katz, 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

Recommendations

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Guarding scenes against invasive hypercubes.
• Local polyhedra and geometric graphs
• The complexity of the free space for motion planning amidst fat obstacles
• Models and motion planning

This page was built for publication: Models and motion planning

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