Combinatorial complexity of translating a box in polyhedral 3-space
From MaRDI portal
Publication:1384201
DOI10.1016/S0925-7721(97)00030-8zbMATH Open0894.68154OpenAlexW2213025670MaRDI QIDQ1384201FDOQ1384201
Authors: Dan Halperin, Chee K. Yap 
Publication date: 30 August 1998
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00030-8
Recommendations
- On Translational Motion Planning of a Convex Polyhedron in 3-Space
- Translating a convex polyhedron over monotone polyhedra
- Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions
- Line transversals of convex polyhedra in \(\mathbb{R}^3\)
- scientific article; zbMATH DE number 1305388
Cites Work
- On the general motion-planning problem with two degrees of freedom
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- The Union of Convex Polyhedra in Three Dimensions
- 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
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- Title not available (Why is that?)
- On critical orientations in the Kedem-Sharir motion planning algorithm
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
- Castles in the air revisited
Cited In (4)
This page was built for publication: Combinatorial complexity of translating a box in polyhedral 3-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384201)
