 |
|
|
|
| HAL: hal-00488274, version 1 |
| Detailed view |  Export this paper |
|
|
| Effective Computational Geometry for Curves and Surfaces (2007) 181-230 |
|
|
|
|
| Meshing of Surfaces |
|
|
| Jean-Daniel Boissonnat 1David Cohen-Steiner 1 |
|
|
| (2007) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | GEOMETRICA (INRIA Sophia Antipolis / INRIA Saclay - Ile de France) |
|
|
|
INRIA |
|
|
| 2: | GALAAD (INRIA Sophia Antipolis) |
|
|
|
INRIA – CNRS : UMR6621 – Université de Nice Sophia Antipolis (UNS) |
|
|
| 3: | Institute of Computer Science |
|
|
|
Freie Universität Berline |
|
|
| 4: | Johann Bernoulli Institute for Mathematics and Computer Science |
|
|
|
University of Groningen |
|
|
|
|
|
|
|
|
|
| Geometrica |
|
|
|
|
| Subject | : | Computer Science/Computational Geometry |
|
|
| Computational geometry – mesh generation – surface approximation |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00488274, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00488274 | |
| oai:hal.archives-ouvertes.fr:hal-00488274 | |
| From: Jean-Daniel Boissonnat | |
| Submitted on: Tuesday, 1 June 2010 16:17:51 | |
| Updated on: Monday, 7 February 2011 11:37:28 | |
