The CGAL Kernel: A Basis for Geometric Computation

@inproceedings{Fabri1996TheCK,
  title={The CGAL Kernel: A Basis for Geometric Computation},
  author={Andreas Fabri and Geert-Jan Giezeman and Lutz Kettner and Stefan Schirra and Sven Sch{\"o}nherr},
  booktitle={WACG},
  year={1996}
}
A large part of the Cgal-project is devoted to the development of a Computational Geometry Algorithms Library, written in C++. We discuss design issues concerning the Cgal-kernel which is the basis for the library and hence for all geometric computation in Cgal. 
Geometric Computing with CGAL and LEDA
Abstract : LEDA and CGAL are platforms for combinatorial and geometric computing. We discuss the use of LEDA and CGAL for geometric computing and show that they provide a unique framework for exact
Efficient exact geometric computation made easy
We show that the combination of the CGAL framework for geometric computation and the number type ledareal yields easy-to-write, correct and efficient geometric programs.
Generic Geometric Programming in the Computational Geometry Algorithms Library
TLDR
This paper describes a number of design issues and programming paradigms that affect the development of Cgal, the computational geometry algorithms library, and explains concepts such as templates, iterators, and traits classes.
A computational basis for higher-dimensional computational geometry and applications
TLDR
A kernel for higher-dimensional computational geometry is described and its application in the calculation of convex hulls and Delaunay triangulations is presented and its use in the application domain is described.
An Adaptable and Extensible Geometry Kernel
TLDR
This paper describes how such a geometry kernel can be designed and implemented in C++, having special emphasis on adaptability, extensibility and efficiency.
On the design of CGAL a computational geometry algorithms library
TLDR
The major design goals for Cgal are correctness exibility ease of use e ciency and robustness and the approach to reach these goals is presented.
Robustness and Precision Issues in Geometric Computation
  • S. Schirra
  • Mathematics
    Handbook of Computational Geometry
  • 2000
DCEL: A Polyhedral Database and Programming Environment
  • G. Barequet
  • Computer Science
    Int. J. Comput. Geom. Appl.
  • 1998
TLDR
The DCEL system is described: a geometric software package which implements a polyhedral programming environment which enables fast prototyping of geometric algorithms for polyhedra or for polyhedral surfaces.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 42 REFERENCES
A "Lazy" Solution to Imprecision in Computational Geometry
TLDR
A simple and eecient paradigm is suggested here, which enables programmers to forget about precision issues altogether, whatever algorithm they intend to implement, and a lazy exact arithmetic library (LEA) is described.
Stable maintenance of point set triangulations in two dimensions
  • S. Fortune
  • Mathematics
    30th Annual Symposium on Foundations of Computer Science
  • 1989
TLDR
The main result is that a triangulation of a set of points in the plane can be maintained stably.
Efficient exact arithmetic for computational geometry
TLDR
An experimental expression compiler is described that conveniently packages the effect of exact integer arithmetic at a cost close to that of floating-point arithmetic by combining tuned multiprecision integer arithmetic and a floating- point filter based on interval analysis.
Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic
Delaunay triangulations in three dimensions with finite precision arithmetic
Towards Exact Geometric Computation
  • C. Yap
  • Computer Science
    Comput. Geom.
  • 1997
Computer graphics—principles and practice
TLDR
These are the short notes for a two hour tutorial on principles and practice of computer graphics and scientific visualization and they cannot completely replace the contents of the tutorial transparencies and slides since restrictions in space and print quality do not permit the inclusion of figures and example images.
Epsilon geometry: building robust algorithms from imprecise computations
This thesis introduces Epsilon Geometry, a framework for the development of robust geometric algorithms using inaccurate primitives. Epsilon Geometry is based on a very general model of imprecise
Checking geometric programs or verification of geometric structures
TLDR
This work gives simple and efficient program checkers for some basic geometric tasks and discusses program checking for data structures that have to rely on user-provided functions.
...
1
2
3
4
5
...