{"title":"Graph-based surface reconstruction using structures in scattered point sets","authors":"R. Mencl, H. Müller","doi":"10.1109/CGI.1998.694281","DOIUrl":null,"url":null,"abstract":"The authors present an algorithm for the reconstruction of a surface from an unorganized set of points in space. The point data may be obtained from a laser range scanner or any other digitizing tool to describe the shape of the object(s). The basic idea of the algorithm is to construct some kind of wire frame for the surface, the so-called surface description graph. This is performed by applying several steps. In the final part of the algorithm this wire frame is then filled with triangles. Each step uses rules for the reconstruction which are based on human knowledge in geometric structures. These rules are designed to allow the reconstruction of artificial objects as well as natural objects and are extendable in many aspects for ongoing research. As a result of this approach, the algorithm is able to reconstruct surfaces in data sites with changing point density as well as high curvature of the surface. In addition, it automatically recognizes the number of objects covered in the point set. Several examples are given to demonstrate its features.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Computer Graphics International (Cat. No.98EX149)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGI.1998.694281","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64
Abstract
The authors present an algorithm for the reconstruction of a surface from an unorganized set of points in space. The point data may be obtained from a laser range scanner or any other digitizing tool to describe the shape of the object(s). The basic idea of the algorithm is to construct some kind of wire frame for the surface, the so-called surface description graph. This is performed by applying several steps. In the final part of the algorithm this wire frame is then filled with triangles. Each step uses rules for the reconstruction which are based on human knowledge in geometric structures. These rules are designed to allow the reconstruction of artificial objects as well as natural objects and are extendable in many aspects for ongoing research. As a result of this approach, the algorithm is able to reconstruct surfaces in data sites with changing point density as well as high curvature of the surface. In addition, it automatically recognizes the number of objects covered in the point set. Several examples are given to demonstrate its features.