Sciweavers

459 search results - page 19 / 92
» Delaunay mesh construction
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Provably good sampling and meshing of Lipschitz surfaces
In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surf...
Jean-Daniel Boissonnat, Steve Oudot
SMI
2003
IEEE
111views Image Analysis» more  SMI 2003»
14 years 27 days ago
Isotropic Surface Remeshing
This paper proposes a new method for isotropic remeshing of triangulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function d...
Pierre Alliez, Éric Colin de Verdièr...
PG
1997
IEEE
13 years 12 months ago
Incremental view-dependent multiresolution triangulation of terrain
A view-dependent multiresolution triangulation algorithm is presented for a real-time flythrough. The triangulation of the terrain is generated incrementally onthe-fly during th...
Reinhard Klein, Daniel Cohen-Or, Tobias Hüttn...
COMPGEOM
2010
ACM
13 years 11 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
COMPGEOM
2003
ACM
14 years 27 days ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote