3D Model Segmentation and Representation with Implicit Polynomials

抄録

When large-scale and complex 3D objects are obtained by range finders, it is often necessary to represent them by algebraic surfaces for such purposes as data compression, multi-resolution, noise elimination, and 3D recognition. Representing the 3D data with algebraic surfaces of an implicit polynomial (IP) has proved to offer the advantages that IP representation is capable of encoding geometric properties easily with desired smoothness, few parameters, algebraic/geometric invariants, and robustness to noise and missing data. Unfortunately, generating a high-degree IP surface for a whole complex 3D shape is impossible because of high computational cost and numerical instability. In this paper we propose a 3D segmentation method based on a cut-and-merge approach. Two cutting procedures adopt low-degree IPs to divide and fit the surface segments simultaneously, while avoiding generating high-curved segments. A merging procedure merges the similar adjacent segments to avoid over-segmentation. To prove the effectiveness of this segmentation method, we open up some new vistas for 3D applications such as 3D matching, recognition, and registration.