Graph-based surface reconstruction using structures in scattered point sets

被引:19
作者
Mencl, R [1 ]
Muller, H [1 ]
机构
[1] Univ Dortmund, D-44221 Dortmund, Germany
来源
COMPUTER GRAPHICS INTERNATIONAL, PROCEEDINGS | 1998年
关键词
D O I
10.1109/CGI.1998.694281
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We 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 at-e based on human knowledge in geometric structures. These roles 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, our algorithm is able to reconstruct surfaces in data sires with changing paint 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.
引用
收藏
页码:298 / 311
页数:14
相关论文
empty
未找到相关数据