On shortest paths in polyhedral spaces
SIAM Journal on Computing
Convex decomposition of polyhedra and robustness
SIAM Journal on Computing
Shape transformation for polyhedral objects
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Strategies for polyhedral surface decomposition: an experimental study
Proceedings of the eleventh annual symposium on Computational geometry
3D Part Segmentation Using Simulated Electrical Charge Distributions
IEEE Transactions on Pattern Analysis and Machine Intelligence
A random sampling scheme for path planning
International Journal of Robotics Research
Mean and maximum common subgraph of two graphs
Pattern Recognition Letters
Adaptively sampled distance fields: a general representation of shape for computer graphics
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Decomposing polygon meshes for interactive applications
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Optimally cutting a surface into a disk
Proceedings of the eighteenth annual symposium on Computational geometry
Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Multiresolution feature extraction for unstructured meshes
Proceedings of the conference on Visualization '01
Partitioning 3D Surface Meshes Using Watershed Segmentation
IEEE Transactions on Visualization and Computer Graphics
A Rectilinearity Measurement for Polygons
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part II
Convex decompositions of polyhedra
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Spherical parametrization and remeshing
ACM SIGGRAPH 2003 Papers
Globally smooth parameterizations with low distortion
ACM SIGGRAPH 2003 Papers
Suggestive contours for conveying shape
ACM SIGGRAPH 2003 Papers
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Approximate convex decomposition of polygons
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Ridge-valley lines on meshes via implicit surface fitting
ACM SIGGRAPH 2004 Papers
ACM SIGGRAPH 2004 Papers
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Estimating Curvatures and Their Derivatives on Triangle Meshes
3DPVT '04 Proceedings of the 3D Data Processing, Visualization, and Transmission, 2nd International Symposium
Feature-based surface parameterization and texture mapping
ACM Transactions on Graphics (TOG)
Fast and robust detection of crest lines on meshes
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Feature Sensitive Mesh Segmentation with Mean Shift
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Mesh scissoring with minima rule and part salience
Computer Aided Geometric Design - Special issue: Geometry processing
Segmenting reliefs on triangle meshes
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Feature sensitive mesh segmentation
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Identifying flat and tubular regions of a shape by unstable manifolds
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Simultaneous shape decomposition and skeletonization
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Measuring Concavity on a Rectangular Mosaic
IEEE Transactions on Computers
A simple and efficient approach for 3D mesh approximate convex decomposition
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
SMI 2012: Full α-Decomposition of polygons
Computers and Graphics
Fast approximate convex decomposition using relative concavity
Computer-Aided Design
| Hi-index | 0.00 |
Decomposition is a technique commonly used to partition complex models into simpler components. While decomposition into convex components results in pieces that are easy to process, such decompositions can be costly to construct and can result in representations with an unmanageable number of components. In this paper we explore an alternative partitioning strategy that decomposes a given model into ''approximately convex'' pieces that may provide similar benefits as convex components, while the resulting decomposition is both significantly smaller (typically by orders of magnitude) and can be computed more efficiently. Indeed, for many applications, an approximate convex decomposition (acd) can more accurately represent the important structural features of the model by providing a mechanism for ignoring less significant features, such as surface texture. We describe a technique for computing acds of three-dimensional polyhedral solids and surfaces of arbitrary genus. We provide results illustrating that our approach results in high quality decompositions with very few components and applications showing that comparable or better results can be obtained using acd decompositions in place of exact convex decompositions (ecd) that are several orders of magnitude larger.