Decomposing the boundary of a nonconvex polyhedron
From MaRDI portal
Publication:675296
DOI10.1007/BF02523191zbMATH Open0865.68121MaRDI QIDQ675296FDOQ675296
Leonidas Palios, Bernard Chazelle
Publication date: 30 June 1997
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Cites Work
- Optimal Search in Planar Subdivisions
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- A linear time algorithm for minimum link paths inside a simple polygon
- Visibility and intersection problems in plane geometry
- Triangulating a nonconvex polytope
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- On separating two simple polygons by a single translation
- Finding the intersection of two convex polyhedra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex Decomposition of Polyhedra and Robustness
Cited In (9)
- Title not available (Why is that?)
- Decomposing the boundary of a nonconvex polyhedron
- Real-time self-collision detection algorithms for tensegrity systems
- THE REFLEX-FREE HULL
- Cell decomposition of polytopes by bending
- Convex Decomposition of Polyhedra and Robustness
- Triangulating a nonconvex polytope
- Convex polygons made from few lines and convex decompositions of polyhedra
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
This page was built for publication: Decomposing the boundary of a nonconvex polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675296)
