Motion planning for a convex polygon in a polygonal environment

DOI10.1007/PL00009455MaRDI QIDQ1302036zbMATH OpenFDO

Authors Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Publication date 12 September 1999

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

motion-planning problemreachability queries

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
• A convex polygon among polygonal obstacle: Placement and high-clearance motion
• An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
• On Translational Motion Planning of a Convex Polyhedron in 3-Space

Cited in

(12)

• Polygon exploration with time-discrete vision
• 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
• Translating a convex polyhedron over monotone polyhedra
• A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
• scientific article; zbMATH DE number 140482 (Why is no real title available?)
• Navigation Functions for Convex Potentials in a Space With Convex Obstacles
• Input-sensitive compliant motion in the plane
• Witness (Delaunay) graphs
• A convex polygon among polygonal obstacle: Placement and high-clearance motion
• Largest similar copies of convex polygons in polygonal domains
• Convex polygon containment: improving quadratic to near linear time

This page was built for publication: Motion planning for a convex polygon in a polygonal environment

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