Results 1  10
of
19
Curve reconstruction from unorganized points
 Computer Aided Geometric Design
, 2000
"... We present an algorithm to approximate a set of unorganized points with a simple curve without selfintersections. The moving leastsquares method has a good ability to reduce a point cloud to a thin curvelike shape which is a nearbest approximation of the point set. In this paper, an improved mov ..."
Abstract

Cited by 67 (3 self)
 Add to MetaCart
(Show Context)
We present an algorithm to approximate a set of unorganized points with a simple curve without selfintersections. The moving leastsquares method has a good ability to reduce a point cloud to a thin curvelike shape which is a nearbest approximation of the point set. In this paper, an improved moving leastsquares technique is suggested using Euclidean minimum spanning tree, region expansion and refining iteration. After thinning a given point cloud using the improved moving leastsquares technique we can easily reconstruct a smooth curve. As an application, a pipe surface reconstruction algorithm is presented.
Interpolation and approximation of surfaces from three–dimensional scattered data points
, 1997
"... There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and the related properties of the data, many algorithms were developed in the past. This contribution gives a survey of exist ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
(Show Context)
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and the related properties of the data, many algorithms were developed in the past. This contribution gives a survey of existing algorithms, and identifies basic methods common to independently developed solutions. We distinguish surface construction based on spatial subdivision, distance functions, warping, and incremental surface growing. The systematic analysis of existing approaches leads to several interesting open questions for further research. nothing is known about the surface from which the data originate. The task is to find the most reasonable solutions among usually several or even many possibilities. Surface reconstruction means that the surface from which the data are sampled is known, say in form of a real model, and the goal is to get a computerbased description of exactly this surface, cf. figure 1. This knowledge may be used in the selection of a favourable algorithm. A proper reconstruc1
A Fast and Efficient ProjectionBased Approach for Surface Reconstruction
 High Performance Computer Graphics, Multimedia and Visualization
, 2002
"... We present a fast and memory efficient algorithm that generates a manifold triangular mesh S with or without boundary passing through a set of unorganized points P ⊂ R³ with no other additional information. Nothing is assumed about the geometry... ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
We present a fast and memory efficient algorithm that generates a manifold triangular mesh S with or without boundary passing through a set of unorganized points P &sub; R&sup3; with no other additional information. Nothing is assumed about the geometry...
Evaluation and Correction of LaserScanned Point Clouds
 In Proc. Videometrics VIII (Electronic Imaging 05
, 2005
"... The digitalization of realworld 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 timecons ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
The digitalization of realworld 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 timeconsuming. 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 multiaxis locomotor system. Measurements on the generated data leads to incorrect results if the contained error is too high. Therefore, processes for geometric inspection under nonlaboratory 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 preprocessing.
Subdivision Surfaces  Can they be Useful for Geometric Modeling Applications?
, 2001
"... This report summarizes the findings and recommendations of the authors concerning the usefulness of subdivision surfaces for geometric modeling, and in particular for engineering applications. The work described is a result of a threemonth collaboration of the authors during the visit of the sec ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This report summarizes the findings and recommendations of the authors concerning the usefulness of subdivision surfaces for geometric modeling, and in particular for engineering applications. The work described is a result of a threemonth collaboration of the authors during the visit of the second author to Boeing in the Summer of 2001.
On Surface Reconstruction: A Priority Driven Approach
 SUBMITTED TO COMPUTERAIDED DESIGN (JCAD)
"... To reconstruct an object surface from a set of surface points, a fast, practical, and efficient priority driven algorithm is presented. The key idea of the method is to consider the shape changes of an object at the boundary of the mesh growing area and to create a priority queue to the advanced fro ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
To reconstruct an object surface from a set of surface points, a fast, practical, and efficient priority driven algorithm is presented. The key idea of the method is to consider the shape changes of an object at the boundary of the mesh growing area and to create a priority queue to the advanced front of the mesh area according to the changes. The mesh growing process is then driven by the priority queue for efficient surface reconstruction. New and practical triangulation criteria are also developed to support the priority driven strategy and to construct a new triangle at each step of mesh growing in real time. The quality and correctness of the created triangles will be guaranteed by the triangulation criteria and topological operations. The algorithm can reconstruct an object surface from unorganized surface points in a fast and reliable manner. Moreover, it can successfully construct the surface of the objects with complex geometry or topology. The efficiency and robustness of the proposed algorithm is validated by extensive experiments.
Construct Piecewise Hermite Interpolation Surface with Blending Methods
 Proc of 2 nd Int. Conf on Geometric Modeling and Processing. IEEE Computer Society
, 2002
"... Three methods are proposed to construct a piecewise Hermite interpolation surface (PHIS), which is a piecewise algebraic surface interpolating a set of given points with associated normal directions. The surface is obtained by blending together some lowdegree surface patches. Both the first and the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Three methods are proposed to construct a piecewise Hermite interpolation surface (PHIS), which is a piecewise algebraic surface interpolating a set of given points with associated normal directions. The surface is obtained by blending together some lowdegree surface patches. Both the first and the second methods are completely local and give a surface with G ncontinuity. In the third construction, we reduce the number of surfaces patches by joining as many cubic patches as possible.This method gives a global solution with G 1continuity. These three different methods can be used to meet different requirements of the designers.
A Fast and Efficient ProjectionBased Approach for Surface Reconstruction
"... We present a fast, memory efficient, linear time algorithm that generates a manifold triangular mesh passing through a set of unorganized points. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that is sampled from a real manifold surface. The speed o ..."
Abstract
 Add to MetaCart
(Show Context)
We present a fast, memory efficient, linear time algorithm that generates a manifold triangular mesh passing through a set of unorganized points. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that is sampled from a real manifold surface. The speed of our algorithm is derived from a projectionbased approach we use to determine the incident faces on a point. Our algorithm has successfully reconstructed the surfaces of unorganized point clouds of sizes varying from 10,000 to 100,000 in about 3–30 seconds on a 250 MHz, R10000 SGI Onyx2. Our technique is especially suitable for height fields like terrain and range scan data even in the presence of noise. We have successfully generated meshes for scan data of size 900,000 points in less than 40 seconds.