Nearly convex segmentation of polyhedra through convex ridge separation

0Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

Decomposing a 3D model into approximately convex components has gained more attention recently due to its ability to efficiently generate small decompositions with controllable concavity bounds. However, current methods are computationally expensive and require many user parameters. These parameters are usually unintuitive thus adding unnecessary obstacles in processing a large number of meshes with various types and shapes or meshes that are generated online within 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  takes a single user parameter: concavity tolerance which controls the maximum concavity of the final components, as input, along with other two fixed parameters for encoding the smoothness term of graph cut. We show that our method can generate comparable (sometimes noticeably better) segmentations in significant shorter time than the current state-of-art methods. Finally, we demonstrate applications of CORISE, including physically-based simulation, cage generation, model repair and mesh unfolding.

Cite

CITATION STYLE

APA

Liu, G., Xi, Z., & Lien, J. M. (2016). Nearly convex segmentation of polyhedra through convex ridge separation. CAD Computer Aided Design, 78, 137–146. https://doi.org/10.1016/j.cad.2016.05.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free