REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY

DOI10.1142/S0218195901000456zbMath1074.68634OpenAlexW2164290756MaRDI QIDQ4682175

René van Oostrum, Otfried Schwarzkopf

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195901000456

zbMATH Keywords

uncertaintyComputational geometryconvex polygonmotion planning

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Aperture-angle and Hausdorff-approximation of convex figures

Cites Work

• The complexity and construction of many faces in arrangements of lines and of segments
• Reaching a goal with directional uncertainty
• Fat Triangles Determine Linearly Many Holes

This page was built for publication: REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY