Share Email Print

Proceedings Paper

Surface reconstruction from unorganized points based on 2D Delaunay neighbors
Author(s): Dong-Ri Shan; Ying-Lin Ke
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The problem of surface reconstruction from unorganized points has been, and continues to be, an important topic of research. Surface reconstruction can be widely used in reverse engineering and visualization of scientific data, etc. In this paper, a new algorithm for surface reconstruction from unorganized points in R is proposed. The algorithm is based on the theorem that the tangent plane of any point on a manifold surface local linear approximates the surface, which means that any point in one scattered point's neighborhood can be found one and only one projection in its tangent plane. In order to reconstruct a surface interpolating the scattered points, we first project the neighbor points of one sample point p to its tangent plane and find its 2D starlike Delaunay neighbors. After that, we define the points whose projection is 2D Delaunay neighbors of p as its 3D Delaunay neighbors. At last, the triangular mesh can be obtained based on the principle that three points consisted one triangular plane patch ifthey are 3D Delaunay neighbors each other. Experimental results show that this algorithm is effective, robust and the output mesh accords with Delaunay character.

Paper Details

Date Published: 31 July 2002
PDF: 8 pages
Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); doi: 10.1117/12.477093
Show Author Affiliations
Dong-Ri Shan, Zhejiang Univ. (China)
Ying-Lin Ke, Zhejiang Univ. (China)

Published in SPIE Proceedings Vol. 4875:
Second International Conference on Image and Graphics
Wei Sui, Editor(s)

© SPIE. Terms of Use
Back to Top