Recent advances in remeshing of surfaces

P Alliez, G Ucelli, C Gotsman, M Attene - Shape analysis and structuring, 2008‏ - Springer
Remeshing is a key component of many geometric algorithms, including modeling, editing,
animation and simulation. As such, the rapidly develo** field of geometry processing has …

[كتاب][B] Delaunay mesh generation

SW Cheng, TK Dey, J Shewchuk, S Sahni - 2013‏ - api.taylorfrancis.com
The study of algorithms for generating unstructured meshes of triangles and tetrahedra
began with mechanical and aeronautical engineers who decompose physical domains into …

Variational shape approximation

D Cohen-Steiner, P Alliez, M Desbrun - ACM SIGGRAPH 2004 Papers, 2004‏ - dl.acm.org
A method for concise, faithful approximation of complex 3D datasets is key to reducing the
computational cost of graphics applications. Despite numerous applications ranging from …

Partial and approximate symmetry detection for 3d geometry

NJ Mitra, LJ Guibas, M Pauly - ACM Transactions on Graphics (ToG), 2006‏ - dl.acm.org
" Symmetry is a complexity-reducing concept [...]; seek it every-where."-Alan J. PerlisMany
natural and man-made objects exhibit significant symmetries or contain repeated …

Interpolating and approximating implicit surfaces from polygon soup

C Shen, JF O'Brien, JR Shewchuk - ACM SIGGRAPH 2004 Papers, 2004‏ - dl.acm.org
This paper describes a method for building interpolating or approximating implicit surfaces
from polygonal data. The user can choose to generate a surface that exactly interpolates the …

Provably good sampling and meshing of surfaces

JD Boissonnat, S Oudot - Graphical Models, 2005‏ - Elsevier
The notion of ε-sample, introduced by Amenta and Bern, has proven to be a key concept in
the theory of sampled surfaces. Of particular interest is the fact that, if E is an ε-sample of a …

Provably good moving least squares

R Kolluri - ACM Transactions on Algorithms (TALG), 2008‏ - dl.acm.org
We analyze a moving least squares (MLS) interpolation scheme for reconstructing a surface
from point cloud data. The input is a sufficiently dense set of sample points that lie near a …

Farthest point seeding for efficient placement of streamlines

A Mebarki, P Alliez, O Devillers - VIS 05. IEEE Visualization …, 2005‏ - ieeexplore.ieee.org
We propose a novel algorithm for placement of streamlines from two-dimensional steady
vector or direction fields. Our method consists of placing one streamline at a time by …

Generative mesh modeling

S Havemann - 2005‏ - diglib.eg.org
Die generative Modellierung ist ein alternativer Ansatz zur Beschreibung von
dreidimensionaler Form. Zugrunde liegt die Idee, ein Modell nicht wie üblich durch eine …

Effective computational geometry for curves and surfaces

JD Boissonnat, M Teillaud - 2006‏ - Springer
Computational geometry emerged as a discipline in the seventies and has had considerable
success in improving the asymptotic complexity of the solutions to basic geometric problems …