Translating a convex polyhedron over monotone polyhedra

DOI10.1016/S0925-7721(02)00098-6zbMath1061.68161MaRDI QIDQ1862129

Subhas C. Nandy, Tetsuo Asano, Antonio Hernández Barrera

Publication date: 10 March 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

polyhedronmotion planningcomputational geometryMinkowski sumpolyhedral terrain

Mathematics Subject Classification ID

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

Related Items (1)

Fast neighborhood search for two- and three-dimensional nesting problems

Cites Work

• Unnamed Item
• Unnamed Item
• Simplified linear-time Jordan sorting and polygon clipping
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Computing convolutions by reciprocal search
• Triangulating a simple polygon in linear time
• 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
• Reentrant polygon clipping
• Location of a Point in a Planar Subdivision and Its Applications
• On Translational Motion Planning of a Convex Polyhedron in 3-Space
• Sorting jordan sequences in linear time using level-linked search trees

This page was built for publication: Translating a convex polyhedron over monotone polyhedra