Abstract
This paper deals with three-dimensional (3D) surface reconstruction from unorganized set of points. Several methods have been developed in the literature. Most of them are based on the 3D Delaunay triangulation. We propose a new method that transforms a set of points into contours in 3D space. This transformation seems to be interesting because the problem of surface reconstruction from contours was widely studies. The triangulation process is composed of the following steps: slicing, 3D curve extraction and tiling. The tiling step is an extension of a well known algorithm used generally for connecting parallel adjacent planar slices. In order to evaluate the performance of our method, we compare it with two well known 3D Delaunay triangulation based methods called α-shape and 3D Crust. We focus on three different comparison criteria: the complexity, the visualization quality and two additional geometrical criteria: the triangulation quality and the rugosity degree.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
