z-logo
Premium
Direct (Re)Meshing for Efficient Surface Processing
Author(s) -
Schreiner John,
Scheidegger Carlos E.,
Fleishman Shachar,
Silva Cláudio T.
Publication year - 2006
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2006.00972.x
Subject(s) - computer science , polygon mesh , parametric surface , merge (version control) , surface (topology) , geometry processing , mesh generation , algorithm , parametrization (atmospheric modeling) , set (abstract data type) , theoretical computer science , computational science , parametric statistics , computer graphics (images) , finite element method , mathematics , parallel computing , geometry , statistics , physics , radiative transfer , quantum mechanics , thermodynamics , programming language
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to surface reconstruction techniques and it requires no explicit parameterization. Our approach is based on the advancing‐front paradigm, and it can be used to both incrementally remesh the complete surface, or simply to remesh a portion of it with a high‐quality mesh. It is accurate, fast, robust, and suitable for use with interactive mesh processing applications that require local remeshing. We show a number of applications, including matching the resolution of meshes when doing Boolean operations such as unions and intersections. We also show how to adapt the algorithm to blend and merge mixed‐mode objects — for example, to compute the union of a point‐set surface and a triangle mesh.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here