CGAL users discussion list

Hi Jens

You can find some {probably incomplete) classified bibliography by 
looking at "Acknowledging CGAL" in the CGAL web site.

There is a "Robustness" entry showing some papers about arithmetics and 
filtering.

About degenerate cases. We usually deal with all cases, which is 
sometimes done using of symbolic perturbations (as shown for instance in 
Olivier Devillers and Monique Teillaud. Perturbations and Vertex Removal 
in a 3D Delaunay Triangulation. In Proc. 14th ACM-SIAM Sympos. Discrete 
Algorithms (SODA), pages 313-319, 2003.)

best
        Monique Teillaud

Jens Rasmussen wrote:
> Hi
>
> I'm a masters student at DIKU (the department of computer science -
> Copenhagen University) specialized in algorithmics and library
> development in C++. I have recently come to learn of CGAL in connection
> with my studies in computational geometry - very impressed!
>
> My current project is about the robustness issue in computational
> geometry, with CGAL as case. I hope to learn enough about CGAL to be
> able to develop an add-on to the project.   
>
> I would like to know if there exists any articles about the concrete
> steps taken in CGAL to achieve robustness (both with respect to the use
> of EGC together with filtering  as well as dealing with degenerate cases
> [do you use a perturbation scheme or do you deal with all cases?]). If
> not then I suppose that the only road to enlightenment will be to read
> the source files (shudder).
>
> I have read the users manual and the developers manual, as well as the
> two articles: An Adaptable and Extensible Geometry Kernel and The CGAL
> Kernel:[...]. But the only thing I learned was that you ensure
> robustness of high-level algorithms by ensuring robustness of the
> primitive predicates and geometric constructions and that "The details
> are pretty complex[...]" (quote from The CGAL Philosophy).
>
> Any help would be appreciated!
> Jens Rasmussen