Applications of the generic programming paradigm in the design of CGAL

Broennimann, H. (Institut National de Recherche d'Informatique et d'Automatique (INRIA), 06 - Sophia Antipolis (France))
Kettner, L. (Eidgenoessische Technische Hochschule, Zurich (Switzerland). Theoretical Computer Science)
Schirra, S. (Max-Planck-Institut fuer Informatik, Saarbruecken (Germany))
Veltkamp, R. (Rijksuniversiteit Utrecht (Netherlands). Dept. of Computer Science)
Max-Planck-Institut fuer Informatik, Saarbruecken (Germany)

Publication date

January 1998

Abstract

We report on the use of the generic programming paradigm in the computational geometry algorithms library CGAL. The parameterization of the geometric algorithms in CGAL enhances flexibility and adaptability and opens an easy way for abolishing precision and robustness problems by exact but nevertheless efficient computation. Furthermore we discuss circulators, which are an extension of the iterator concept to circular structures. Such structures arise frequently in geometric computing. (orig.)SIGLEAvailable from TIB Hannover: RR 1912(98-1-030) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Extracted data

We use cookies to provide a better user experience.

Data Protection

Applications of the generic programming paradigm in the design of CGAL

Abstract

Extracted data

Applications of the generic programming paradigm in the design of CGAL

Abstract

Extracted data

Related items

Related items