Table of


The goal of CGAL, the Computational Geometry Algorithms Library written in C++, is to make the large body of geometric algorithms developed in the field of computational geometry available for industrial application. Major design goals for CGAL are correctness, flexibility, easeofuse, efficiency, and robustness. Templates and the new generic programming paradigm play a central role in the architecture of CGAL to achieve flexibility and efficiency.
The birth of CGAL dates back to a meeting in Utrecht in January 1995. Shortly afterwards, the five authors of [Fabri et.al. 96] started developing the kernel. The CGALproject has been funded officially since October 1996 and the team of developers has grown considerably among professionals in the field of computational geometry and related areas, in academia especially research assistants, PhD students and postdocs. The CGAL release 2.2 of October 2000 consists of approximately 160,000 lines of C++ source code for the library, plus 80,000 lines for accompanying sources, such as the test suite and example programs, not counting C++ comments or empty lines. In terms of the elder Constructive Cost Model (COCOMO) the line counts, the people involved, and the time schedule indicate a large project comparable to operating systems or database management systems. The WWW homepage, http://www.cgal.org/ of CGAL provides a list of publications about CGAL and related research. Seleted publications, where I am involved in, are listed below.
11 
Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments. Peter Hachenberger and Lutz Kettner. In: Proc. of 2005 ACM Symposium on Solid and Physical Modeling (SPM), Cambridge, MA. pp. 163174, June, 2005. © ACM 2005. [Abstract] [PDF] [PostScript] 
10 
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, and Michael Seel. In: Proc. of the 11th Annu. European Sympos. Algorithms (ESA'03), Budapest, Hungary. LNCS 2832, Springer, pp. 654666, September, 2003. © SpringerVerlag [Abstract] [PDF] [PostScript] 
9 
Two Computational Geometry Libraries: LEDA and CGAL. Lutz Kettner and Stefan Näher. In: Jacob E. Goodman and Joseph O'Rourke (Eds.), Handbook of Discrete and Computational Geometry, 2nd edition, CRC Press LLC, pp. 14351463, 2004. [CRC Press Handbook Home Page] 
8 
An Adaptable and Extensible Geometry Kernel. Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Michael Seel. In: Proc. of the 5th Workshop on Algorithm Engineering (WAE'01), Århus, Denmark. LNCS 2141, Springer, pp. 7691, August, 2001. [Abstract] [PDF] 
7 
On the Design of CGAL, the Computational Geometry Algorithms Library. Andreas Fabri, GeertJan Giezeman, Lutz Kettner, Stefan Schirra, and Sven Schönherr. In: Software  Practice and Experience 30, pp. 11671202, 2000. © John Wiley & Sons Ltd 2000. [Abstract] [PostScript Preprint] 
6 
Applications of the Generic Programming Paradigm in the Design of CGAL. Hervé Brönnimann, Lutz Kettner, Stefan Schirra, and Remco Veltkamp. In: M. Jazayeri, R. Loos, and D. Musser (Eds.), Generic Programming  Proceedings of a Dagstuhl Seminar, LNCS 1766, Springer, 2000. [Abstract] [PostScript] 
5 
Using Generic Programming for Designing a Data Structure for Polyhedral Surfaces. Lutz Kettner. In: Computational Geometry  Theory and Applications 13, pp. 6590, 1999. © Elsevier 1999 [Abstract] [PostScript Preprint] 
4 
Software Design in Computational Geometry and ContourEdge Based Polyhedron Visualization. Lutz Kettner. PhD Thesis, ETH Zürich, Institute of Theoretical Computer Science, 148 pages, September 1999. [Abstract] [PostScript, A4 size] [PostScript, letter size] 
3 
The CGAL Kernel: A Basis for Geometric Computation. Andreas Fabri, GeertJan Giezeman, Lutz Kettner, Stefan Schirra, and Sven Schönherr. In: ACM Workshop on Applied Computational Geometry, Philadelphia, Pennsylvenia. May, 2728. LNCS 1148, Springer, 1996. [Abstract] [PostScript] 
2 
Visualisation and Simulation. Lutz Kettner. In: CGAL Workpackage 4: Report 2, pp. 1217. The CGAL Consortium, Fall 1997. [PostScript] 
1 
Visualisation and Simulation. Mark de Berg and Lutz Kettner. In: CGAL Workpackage 4: Report 1, pp. 2024. The CGAL Consortium, April 1997. [PostScript] 
Example program files and presentation slides of the CGAL Tutorial I at the Symposium of Computational Geometry, SCG'99, in Miami.
Course 15: Migrating to an ObjectOriented Graphics API. Organized by Sherif Ghali. Lecturers: David Blythe, SGI, Sherif Ghali, Max Planck Institute for Computer Science, Lutz Kettner, University of North Carolina at Chapel Hill, and Henry Sowizral, Sun Microsystems, Inc.
Surface reconstruction in 3D of an unorganized sequence of input points using the crust algorithm of N. Amenta, S. Choi, T. Dey, N. Leekha: A Simple Algorithm for Homeomorphic Surface Reconstruction. In Proc. 16th Annu. ACM Sympos. Comput. Geom., 2000.