Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
Feature Sensitive Mesh Segmentation with Mean Shift
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Geodesic Remeshing Using Front Propagation
International Journal of Computer Vision
Partial and approximate symmetry detection for 3D geometry
ACM SIGGRAPH 2006 Papers
A new CAD mesh segmentation method, based on curvature tensor analysis
Computer-Aided Design
LR: compact connectivity representation for triangle meshes
ACM SIGGRAPH 2011 papers
| Hi-index | 0.00 |
We present a novel algorithm to partition large 3D meshes for GPU-based decompression. Our formulation focuses on minimizing the replicated vertices between patches, and balancing the numbers of faces of patches for efficient parallel computing. First we generate a topology model of the original mesh and remove vertex positions. Then we assign the centers of patches using geodesic farthest point sampling and cluster the faces according to geodesic distance. After the segmentation we swap boundary faces to fix jagged boundaries and store the boundary vertices for whole-mesh preservation. The decompression of each patch runs on a thread of GPU, we have evaluated its performance on various large benchmarks. In practice, the GPU-based decompression algorithm runs more than 48X faster with that on the CPU.