DMCA
Surface Reconstruction by Voronoi Filtering (1998)
| Venue: | Discrete and Computational Geometry |
| Citations: | 403 - 11 self |
BibTeX
@ARTICLE{Amenta98surfacereconstruction,
author = {Nina Amenta and Marshall Bern},
title = {Surface Reconstruction by Voronoi Filtering},
journal = {Discrete and Computational Geometry},
year = {1998},
volume = {22},
pages = {481--504}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We give a simple combinatorial algorithm that computes a piecewise-linear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled surfaces, where density depends on "local feature size", the output is topologically valid and convergent (both pointwise and in surface normals) to the original surface. We describe an implementation of the algorithm and show example outputs. 1 Introduction The problem of reconstructing a surface from scattered sample points arises in many applications such as computer graphics, medical imaging, and cartography. In this paper we consider the specific reconstruction problem in which the input is a set of sample points S drawn from a smooth two-dimensional manifold F embedded in three dimensions, and the desired output is a triangular mesh with vertex set equal to S that faithfully represen...
Keyphrases
surface reconstruction voronoi filtering many application algorithm correct piecewise-linear approximation sample point sample point drawn specific reconstruction problem algorithm us voronoi vertex computer graphic local feature size surface normal scattered sample point show example output smooth surface medical imaging triangular mesh desired output original surface finite set delaunay triangulation smooth two-dimensional manifold simple combinatorial algorithm
