Strategies for polyhedral surface decomposition: an experimental study.

DOI10.1016/S0925-7721(96)00024-7MaRDI QIDQ2482891zbMATH OpenOpenAlexFDO

Authors Bernard Chazelle, N. Shouraboura, Ayellet Tal, David P. Dobkin

Publication date 25 April 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(96)00024-7

zbMATH Keywords

NP-completeness3-SATConvexityFlooding heuristicsSurface decomposition

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• scientific article; zbMATH DE number 4205983
• Convex Decomposition of Polyhedra and Robustness
• On surface-minimizing polyhedral decompositions
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Triangulating a nonconvex polytope

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 589122 (Why is no real title available?)
• scientific article; zbMATH DE number 741009 (Why is no real title available?)
• Bounds on the size of tetrahedralizations
• Castles in the air revisited
• Convex Decomposition of Polyhedra and Robustness
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Fast detection of polyhedral intersection
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Provably good mesh generation
• Triangles in space or building (and analyzing) castles in the air
• Triangulating a nonconvex polytope

Cited in

(15)

• Optimal decomposition of polygonal models into triangle strips
• A survey on Mesh Segmentation Techniques
• Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
• Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy
• Free-form surface partition in 3-d
• Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
• A phase-field approach to variational hierarchical surface segmentation
• Decomposition method for extracting face topologies from wireframe models
• Approximate convex decomposition of polyhedra and its applications
• 3D intelligent scissors for dental mesh segmentation
• Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
• Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
• Minimum decomposition of a digital surface into digital plane segments is NP-hard
• Reeb graph based segmentation of articulated components of 3D digital objects
• A new scheme for efficient and direct shape optimization of complex structures represented by polygonal meshes

This page was built for publication: Strategies for polyhedral surface decomposition: an experimental study.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482891)