Approximate convex decomposition of polyhedra and its applications

DOI10.1016/j.cagd.2008.05.003zbMath1172.65355OpenAlexW1983687767MaRDI QIDQ735498

Jyh-Ming Lien, Nancy M. Amato

Publication date: 22 October 2009

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2008.05.003

zbMATH Keywords

convex decompositionconcavity measurementfeature grouping

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Computing with Non-convex Polyhedra on the GPU

Uses Software

• FIST
• SegMatch

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimally cutting a surface into a disk
• Strategies for polyhedral surface decomposition: an experimental study.
• Mesh scissoring with minima rule and part salience
• On Shortest Paths in Polyhedral Spaces
• Convex Decomposition of Polyhedra and Robustness
• Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions
• Approximate Euclidean Shortest Paths in 3-Space
• Approximate convex decomposition of polygons
• Segmenting Periodic Reliefs on Triangle Meshes
• Measuring Concavity on a Rectangular Mosaic
• Algorithms and Data Structures

This page was built for publication: Approximate convex decomposition of polyhedra and its applications