Decomposing the boundary of a nonconvex polyhedron
From MaRDI portal
(Redirected from Publication:675296)
Recommendations
Cites work
- scientific article; zbMATH DE number 3825165 (Why is no real title available?)
- scientific article; zbMATH DE number 3767037 (Why is no real title available?)
- A linear time algorithm for minimum link paths inside a simple polygon
- Convex Decomposition of Polyhedra and Robustness
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Finding the intersection of two convex polyhedra
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On separating two simple polygons by a single translation
- Optimal Search in Planar Subdivisions
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Triangulating a nonconvex polytope
- Visibility and intersection problems in plane geometry
Cited in
(11)- scientific article; zbMATH DE number 3901545 (Why is no real title available?)
- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
- Decomposing the boundary of a nonconvex polyhedron
- Real-time self-collision detection algorithms for tensegrity systems
- Approximate convex decomposition of polyhedra and its applications
- 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)
