Abstract:
This paper describes a number of design issues and programming paradigms that aect the development of Cgal, the computational geometry algorithms library. Genericity of the library is achieved by concepts such as templates, iterators, and traits classes. This allows the application programmer to plug in own types of containers and point types, for example. The paper gives an explanation of these concepts and examples of how they are used. 1
Citations
|
1540
|
Computational Geometry: An Introduction
– Preparata, Shamos
- 1985
|
|
566
|
O.: Computational Geometry. Algorithms and Applications
– Berg, Kreveld, et al.
- 2000
|
|
403
|
Computational geometry in C
– O'Rourke
- 1998
|
|
274
|
Computational Geometry. An introduction through randomized algorithms
– Mulmuley
- 1994
|
|
94
|
The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library
– Musser, Saini
- 1995
|
|
66
|
Algorithmic Geometry
– Boissonnat, Yvinec
- 1998
|
|
54
|
The GNU multiple precision arithmetic library. http://www.swox.com/gmp
– GRANLUND
|
|
45
|
Stable maintenance of point-set triangulation in two-dimensions
– FORTUNE
- 1989
|
|
41
|
Designing the Computational Geometry Algorithms Library CGAL
– Overmars
- 1996
|
|
34
|
Handbook of discrete and computational geometry
– Goodman, O’Rourke
- 1997
|
|
13
|
Delaunay triangulations in three dimensions with finite precision arithmetic
– DEY, SUGIHARA, et al.
- 1992
|
|
8
|
Designing a computational geometry algorithms library
– Schirra
|
|
5
|
Getting started with CGAL
– Giezeman, Veltkamp, et al.
- 1998
|
|
5
|
Properties of surface-normal transformations
– Turkowski
- 1990
|
|
1
|
The LEDA user manual. URL http://www. mpi-sb.mpg.de/LEDA
– Mehlhorn, Naher, et al.
|