Evaluation and Correction of Laser-Scanned Point Clouds

The digitalization of real-world objects is of great importance in various application domains. E. g.in industrial processes quality assurance is very important. Geometric properties of workpieces have to be measured. Traditionally, this is done with gauges which is somewhat subjective and time-consuming. We developed a robust optical laser scanner for the digitalization of arbitrary objects, primary, industrial workpieces. As measuring principle we use triangulation with structured lighting and a multi-axis locomotor system. Measurements on the generated data leads to incorrect results if the contained error is too high. Therefore, processes for geometric inspection under non-laboratory conditions are needed that are robust in permanent use and provide high accuracy as well as high operation speed. The many existing methods for polygonal mesh optimization produce very esthetic 3D models but often require user interaction and are limited in processing speed and/or accuracy. Furthermore, operations on optimized meshes consider the entire model and pay only little attention to individual measurements. However, many measurements contribute to parts or single scans with possibly strong differences between neighboring scans being lost during mesh construction. Also, most algorithms consider unsorted point clouds although the scanned data is structured through device properties and measuring principles. We use this underlying structure to achieve high processing speeds and extract intrinsic system parameters to use them for fast pre-processing.

[1]  Sang Uk Lee,et al.  Constructing NURBS surface model from scattered and unorganized range data , 1999, Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062).

[2]  Matthias Eck,et al.  Automatic reconstruction of B-spline surfaces of arbitrary topological type , 1996, SIGGRAPH.

[3]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[4]  K. Klein,et al.  Adaptive Triangulation Of Objects Reconstructed From Multiple Range Images , 2001 .

[5]  David F. Rogers,et al.  An Introduction to NURBS , 2000 .

[6]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[7]  W. Boehler,et al.  3 D SCANNING SOFTWARE : AN INTRODUCTION , 2002 .

[8]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[9]  Chandrajit L. Bajaj,et al.  Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data , 1997, Algorithmica.

[10]  Marc Alexa,et al.  Point set surfaces , 2001, Proceedings Visualization, 2001. VIS '01..

[11]  Larry L. Schumaker,et al.  Shape-preserving knot removal , 1996, Comput. Aided Geom. Des..

[12]  Reinhard Koch,et al.  3D Structure from Multiple Images of Large-Scale Environments , 1998, Lecture Notes in Computer Science.

[13]  Gabriel Taubin,et al.  Building a Digital Model of Michelangelo's Florentine Pietà , 2002, IEEE Computer Graphics and Applications.

[14]  R. Bartels,et al.  Fitting Uncertain Data with NURBS , 1997 .

[15]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

[16]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[17]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[18]  J. Hadenfeld,et al.  Iteratives Glätten von B-Spline Kurven und B-Spline Flächen , 1998 .

[19]  U. Dietz Geometrie-Rekonstruktion aus Meßpunktwolken mit glatten B-Spline-Flächen , 1998 .

[20]  Matthias Eck,et al.  Knot removal for B-spline curves , 1995, Comput. Aided Geom. Des..

[21]  Holly E. Rushmeier,et al.  The 3D Model Acquisition Pipeline , 2002, Comput. Graph. Forum.