The ball-pivoting algorithm for surface reconstruction
F Bernardini, J Mittleman, H Rushmeier… - IEEE transactions on …, 1999 - ieeexplore.ieee.org
The Ball-Pivoting Algorithm (BPA) computes a triangle mesh interpolating a given point
cloud. Typically, the points are surface samples acquired with multiple range scans of an …
cloud. Typically, the points are surface samples acquired with multiple range scans of an …
[PDF][PDF] Surface reconstruction by Voronoi filtering
We give a simple combinatorial algorithm that computes a piecewlze-linear approximation of
a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to …
a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to …
[PDF][PDF] A new Voronoi-based surface reconstruction algorithm
We describe our experience with a new algorithm for the reconstruction of surfaces from
unorganized sample points in IR3. The algorithm is the first for this problem with provable …
unorganized sample points in IR3. The algorithm is the first for this problem with provable …
The 3D model acquisition pipeline
F Bernardini, H Rushmeier - Computer graphics forum, 2002 - Wiley Online Library
Three‐dimensional (3D) image acquisition systems are rapidly becoming more affordable,
especially systems based on commodity electronic cameras. At the same time, personal …
especially systems based on commodity electronic cameras. At the same time, personal …
[PDF][PDF] A simple algorithm for homeomorphic surface reconstruction
The problem of computing a piecewise linear approximation to a surface from a set of
sample points on the surface has been a focus of research in solid modeling and graphics …
sample points on the surface has been a focus of research in solid modeling and graphics …
[图书][B] Curve and surface reconstruction: algorithms with mathematical analysis
TK Dey - 2006 - books.google.com
Many applications in science and engineering require a digital model of a real physical
object. Advanced scanning technology has made it possible to scan such objects and …
object. Advanced scanning technology has made it possible to scan such objects and …
[PDF][PDF] Smooth surface reconstruction via natural neighbour interpolation of distance functions
JD Boissonnat, F Cazals - … of the sixteenth annual symposium on …, 2000 - dl.acm.org
We present an algorithm to reconstruct smooth surfaces of arbitrary topology from
unorganised sample points and normals. The method uses natural neighbour interpolation …
unorganised sample points and normals. The method uses natural neighbour interpolation …
Surface reconstruction based on lower dimensional localized Delaunay triangulation
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S
passing through a set of unorganized points PR 3. Nothing is assumed about the geometry …
passing through a set of unorganized points PR 3. Nothing is assumed about the geometry …
Approximate medial axis as a voronoi subcomplex
TK Dey, W Zhao - Proceedings of the seventh ACM symposium on Solid …, 2002 - dl.acm.org
Medial axis as a compact representation of shapes has evolved as an essential geometric
structure in a number of applications involving 3D geometric shapes. Since exact …
structure in a number of applications involving 3D geometric shapes. Since exact …
Geometric compression for interactive transmission
O Devillers, PM Gandoin - Proceedings Visualization 2000. VIS …, 2000 - ieeexplore.ieee.org
The compression of geometric structures is a relatively new field of data compression. Since
about 1995, several articles have dealt with the coding of meshes, using for most of them the …
about 1995, several articles have dealt with the coding of meshes, using for most of them the …