A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
From MaRDI portal
(Redirected from Publication:1923770)
Recommendations
- Motion planning for a convex polygon in a polygonal environment
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
Cites work
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
- Almost tight upper bounds for the single cell and zone problems in the three dimensions
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- Castles in the air revisited
- Extremal polygon containment problems
- scientific article; zbMATH DE number 431984 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 797447 (Why is no real title available?)
- On critical orientations in the Kedem-Sharir motion planning algorithm
- On lazy randomized incremental construction
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- On the two-dimensional Davenport-Schinzel problem
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Triangles in space or building (and analyzing) castles in the air
Cited in
(10)- 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 motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- Motion planning for a convex polygon in a polygonal environment
- Motion planning and control of a planar polygonal linkage
- A quasi-Newton-based floorplanner for fixed-outline floorplanning
- Input-sensitive compliant motion in the plane
- Computing the configuration space for a robot on a mesh-of-prosessors
- Optimal algorithms for separating a polyhedron from its single-part mold
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
This page was built for publication: A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923770)
