Abstract
Given a finite set of points sampled from a surface, the task of surface reconstruction is to find a triangular mesh connecting the sample points and approximating the surface. The solution presented in this paper takes into consideration additional information often available in sample data sets in form of scan paths. This additional information allows to cope with edges or ridges more reliably than algorithms developed for unstructured point clouds.KeywordsFeature PointMinimum Span TreeDelaunay TriangulationTriangular MeshSteiner PointThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
