Decomposing the boundary of a nonconvex polyhedron
From MaRDI portal
Publication:675296
DOI10.1007/BF02523191zbMath0865.68121MaRDI QIDQ675296
Leonidas Palios, Bernard Chazelle
Publication date: 30 June 1997
Published in: Algorithmica (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Visibility and intersection problems in plane geometry
- Triangulating a nonconvex polytope
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Finding the intersection of two convex polyhedra
- On separating two simple polygons by a single translation
- A linear time algorithm for minimum link paths inside a simple polygon
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Optimal Search in Planar Subdivisions
- Convex Decomposition of Polyhedra and Robustness
This page was built for publication: Decomposing the boundary of a nonconvex polyhedron
