Skip to Main content Skip to Navigation
Book sections

Meshing of Surfaces

Jean-Daniel Boissonnat 1 David Cohen-Steiner 1 Bernard Mourrain 2 Guenter Rote 3 Gert Vegter 4
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
2 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis (... - 2019), CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : Meshing algorithms can be roughly characterized as (i) continuation-based methods, that grow a mesh following the surface, and (ii) mesh-based methods, which build some sort of three-dimensional scaffolding around the surface. Although continuation-based methods are often used in practice, it is not easy to achieve correctness guarantees for them. Thus, all algorithms discussed in this paper fall into the second category. There are three types of adaptive “grid structures” which are used: axis-aligned cubes, vertical planes, and the Voronoi diagram. The algorithms use different algorithmic strategies and a variety of conditions to ensure topological correctness.
Document type :
Book sections
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Jean-Daniel Boissonnat <>
Submitted on : Tuesday, June 1, 2010 - 4:17:51 PM
Last modification on : Thursday, December 17, 2020 - 4:36:02 PM
Long-term archiving on: : Friday, September 17, 2010 - 11:41:35 AM


Files produced by the author(s)


  • HAL Id : hal-00488274, version 1



Jean-Daniel Boissonnat, David Cohen-Steiner, Bernard Mourrain, Guenter Rote, Gert Vegter. Meshing of Surfaces. Effective Computational Geometry for Curves and Surfaces, Springer, pp.181-230, 2007, Mathematics and Visualization. ⟨hal-00488274⟩



Record views


Files downloads