Translating a convex polyhedron over monotone polyhedra
From MaRDI portal
(Redirected from Publication:1862129)
Recommendations
- On Translational Motion Planning of a Convex Polyhedron in 3-Space
- Combinatorial complexity of translating a box in polyhedral 3-space
- Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions
- Motion planning for a convex polygon in a polygonal environment
- On some polyhedra covering problems
Cites work
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- Combinatorial complexity of translating a box in polyhedral 3-space
- Computing convolutions by reciprocal search
- scientific article; zbMATH DE number 4211551 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Location of a Point in a Planar Subdivision and Its Applications
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- On Translational Motion Planning of a Convex Polyhedron in 3-Space
- Reentrant polygon clipping
- Simplified linear-time Jordan sorting and polygon clipping
- Sorting jordan sequences in linear time using level-linked search trees
- Triangulating a simple polygon in linear time
Cited in
(3)
This page was built for publication: Translating a convex polyhedron over monotone polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862129)