Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Eurographics Symposium on Geometry Processing (2007), pp. 110 Alexander Belyaev, Michael Garland (Editors)
 

Summary: Eurographics Symposium on Geometry Processing (2007), pp. 1­10
Alexander Belyaev, Michael Garland (Editors)
A Streaming Algorithm for Surface Reconstruction
Rémi Allègre, Raphaëlle Chaine, Samir Akkouche
Université de Lyon, Université Claude Bernard Lyon 1, LIRIS UMR CNRS 5205, France
Abstract
We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on
a geometric convection technique. Assuming that the sample points are organized into slices stacked along one
coordinate axis, a triangle mesh can be efficiently reconstructed in a streamable layout with a controlled memory
footprint. Our algorithm associates a streaming 3D Delaunay triangulation data-structure with a multilayer ver-
sion of the geometric convection algorithm. Our method can process millions of sample points at the rate of 50k
points per minute with 350 MB of main memory.
Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry
and Object Modeling
Keywords: Streaming surface reconstruction, streaming Delaunay triangulation, geometric convection.
1. Introduction
We consider the problem of reconstructing mesh surfaces
from large sets of sample points using a Delaunay triangu-
lation. This geometric data-structure has proved to be par-
ticularly well-suited for devising general and efficient 3D

  

Source: Allègre, Rémi - Département Informatique, Université de Strasbourg
Chaine, Raphaëlle - Laboratoire d'InfoRmatique en Image et Systèmes d'information, Université Claude Bernard (Lyon I)
Kazhdan, Michael - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences