Results 1 
4 of
4
On the design of CGAL a computational geometry algorithms library
 Softw. – Pract. Exp
, 1998
"... CGAL is a Computational Geometry Algorithms Library written in C++, which is being developed by research groups in Europe and Israel. The goal is to make the large body of geometric algorithms developed in the field of computational geometry available for industrial application. We discuss the major ..."
Abstract

Cited by 90 (15 self)
 Add to MetaCart
CGAL is a Computational Geometry Algorithms Library written in C++, which is being developed by research groups in Europe and Israel. The goal is to make the large body of geometric algorithms developed in the field of computational geometry available for industrial application. We discuss the major design goals for CGAL, which are correctness, flexibility, easeofuse, efficiency, and robustness, and present our approach to reach these goals. Generic programming using templates in C++ plays a central role in the architecture of CGAL. We give a short introduction to generic programming in C++, compare it to the objectoriented programming paradigm, and present examples where both paradigms are used effectively in CGAL. Moreover, we give an overview of the current structure of the CGALlibrary and consider software engineering aspects in the CGALproject. Copyright c ○ 1999 John Wiley & Sons, Ltd. KEY WORDS: computational geometry; software library; C++; generic programming;
Applications of the Generic Programming Paradigm in the Design of CGAL
, 1998
"... 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 exibility and adaptability and opens an easy way for abolishing precision and robustness problems by exact but neverthe ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
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 exibility and adaptability and opens an easy way for abolishing precision and robustness problems by exact but nevertheless ecient computation. Furthermore we discuss circulators, which are an extension of the iterator concept to circular structures. Such structures arise frequently in geometric computing. 1 Introduction cgal is a C++ library of geometric algorithms and data structures. It is developed by several sites in Europe and Israel. The goal is to enhance the technology transfer of the algorithmic knowledge developed in the eld of computational geometry to applications in industry and academia. Computational geometry is the subarea of algorithm design that deals with the design and analysis of algorithms for geometric problems involving objects like points, lines, polygons, and polyhedra. Ove...
Applications of the Generic Programming Paradigm in the Design of CGAL
"... . 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 exibility and adaptability and opens an easy way for abolishing precision and robustness problems by exact but never ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. 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 exibility and adaptability and opens an easy way for abolishing precision and robustness problems by exact but nevertheless ecient computation. Furthermore we discuss circulators, which are an extension of the iterator concept to circular structures. Such structures arise frequently in geometric computing. 1 Introduction cgal is a C++ library of geometric algorithms and data structures. It is developed by several sites in Europe and Israel. The goal is to enhance the technology transfer of the algorithmic knowledge developed in the eld of computational geometry to applications in industry and academia. Computational geometry is the subarea of algorithm design that deals with the design and analysis of algorithms for geometric problems involving objects like points, lines, polygons, and polyhedra....
Planar Nef Polyhedra and . . .
, 2001
"... We present two generic software projects that are part of the software library CGAL. The first part describes the design of a geometry kernel for higherdimensional Euclidean geometry and the interaction with application programs. We describe the software structure, the interface concepts, and their ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present two generic software projects that are part of the software library CGAL. The first part describes the design of a geometry kernel for higherdimensional Euclidean geometry and the interaction with application programs. We describe the software structure, the interface concepts, and their models that are based on coordinate representation, number types, and memory layout. In the higherdimensional software kernel the interaction between linear algebra and the geometric objects and primitives is one important facet. In the actual design our users can replace number types, representation types, and the traits classes that inflate kernel functionality into our current application programs: higherdimensional convex hulls and Delaunay tedrahedralisations. In the second part we present the realization of planar Nef polyhedra. The concept of Nef polyhedra subsumes all kinds of rectilinear polyhedral subdivisions and is therefore of general applicability within a geometric software library. The software is based on the theory of extended points and segments that allows us to reuse classical algorithmic solutions like plane sweep to realize binary operations of Nef polyhedra.