Strategies for polyhedral surface decomposition: an experimental study.
From MaRDI portal
Publication:2482891
DOI10.1016/S0925-7721(96)00024-7zbMath1133.52305OpenAlexW2202770087MaRDI QIDQ2482891
N. Shouraboura, Ayellet Tal, Bernard Chazelle, 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
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (10)
Reeb graph based segmentation of articulated components of 3D digital objects ⋮ Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy ⋮ Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces ⋮ A survey on Mesh Segmentation Techniques ⋮ A phase-field approach to variational hierarchical surface segmentation ⋮ FREE-FORM SURFACE PARTITION IN 3-D ⋮ Approximate convex decomposition of polyhedra and its applications ⋮ Minimum decomposition of a digital surface into digital plane segments is NP-hard ⋮ A new scheme for efficient and direct shape optimization of complex structures represented by polygonal meshes ⋮ 3D intelligent scissors for dental mesh segmentation
Cites Work
- Fast detection of polyhedral intersection
- Triangulating a nonconvex polytope
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Provably good mesh generation
- Castles in the air revisited
- Bounds on the size of tetrahedralizations
- Triangles in space or building (and analyzing) castles in the air
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Convex Decomposition of Polyhedra and Robustness
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strategies for polyhedral surface decomposition: an experimental study.
