Nearly Convex Decomposition through Convex Ridge Separation
Guilin Liu, Zhonghua Xi and Jyh-Ming Lien
Overview
Decomposing a 3D model into approximately convex components has gained more attention recently due to its ability to efficiently generate small decomposition with controllable concavity bound. However, current methods are computationally expensive and require many user parameters. These parameters are usually unintuitive and add unnecessary obstacles in processing a large number of meshes and meshes that are generated online in applications such as video games. In this paper, we investigate an approach that decomposes a mesh P based on the identification of Convex Ridges. Intuitively, convex ridges are the protruding parts of the mesh P. Our method, called CoRise, extracts nearly convex components of P by separating each convex ridge from all the other convex ridges. Through the new concept of Residual Concavity, CoRise requires only a single user parameter: concavity tolerance. We show that our method can generate noticeably better segmentation in significant shorter time than the current state-of-art methods. Finally, we demonstrate applications of CoRise, including physically-based simulation, cage generation and model repair.Publications
Nearly Convex Segmentation of Polyhedra Through Convex Ridge Separation, Guilin Liu and Zhonghua Xi and Jyh-Ming Lien, Symposium on Solid & Physical Modeling (SPM); also appears in Journal of Computer-Aided Design, Jun. 2016
Web Site / Paper(pdf) / BibTeX
Web Site / Paper(pdf) / BibTeX
Nearly Convex Segmentation of Polyhedra Through Convex Ridge Separation, Guilin Liu and Zhonghua Xi and Jyh-Ming Lien, Department of Computer Science, George Mason University, (Technical Report), 2015
Web Site / Paper (pdf) / BibTeX
Web Site / Paper (pdf) / BibTeX
Video: Collision Detection Simulation using CoRise
Result
