Abstract
There is a wide range of applications, such as solid modeling, computer graphics or computer vision, for which surface reconstruction of scattered data points in space is important. Many algorithms were developed in the past depending on the field of application and related properties of the data. This paper presents some improvements to the already existing one-pass CRUST algorithm build on Delaunay tetrahedronization and Voronoi diagrams.
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.
