CGAL users discussion list

[YB <>]

Thank you Laurent.

Do I get the simplified idea of CGAL's meshing procedure correctly?

1. Our oracle gives us some points in the isosurface

2. A restricted Delaunay triangulation is computed for these points and
gives us already a good approximation

3. In the resulting triangulation skinny triangles below some limit are
eliminated by applying Delaunay refinement


On 25.02.2019 09:59, Laurent Rineau (CGAL/GeometryFactory) wrote:
> On Saturday, February 23, 2019 10:11:24 AM CET 
> 
>  wrote:
>> Hello everyone,
>>
>> I'm using CGAL to mesh isosurfaces defined as gray levels in 3D images. It
>> produces nice results. However, I don't have a clue how the underlying
>> algorithm works. Can someone explain to me on a high-level what the
>> algorithm does?
>> The cited paper "Jean-Daniel Boissonnat and Steve Oudot. Provably good
>> sampling and meshing of surfaces. Graphical Models, 67:405–451, 2005." goes
>> to much into detail. I can not really follow it, due to missing background.
> Hi, the two tools to understand are :
>
>   - the "Delaunay refinement" algorithm,
>   - and "restricted Delaunay triangulations".
>
> You can search for introduction materials on the web. Most of them are
> scientific articles, and presentation slides, but you can also find teaching
> notes (for master degrees), and a few videos.
>