Decomposing the boundary of a nonconvex polyhedron

DOI10.1007/BF02523191zbMATH Open0865.68121MaRDI QIDQ675296FDOQ675296

Leonidas Palios, Bernard Chazelle

Publication date: 30 June 1997

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

nonconvex polyhedron

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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
• Convex Decomposition of Polyhedra and Robustness
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Real-time self-collision detection algorithms for tensegrity systems
• Cell decomposition of polytopes by bending

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)