- Stxxl : Standard Template Library for XXL Roman Dementiev1
- Applications of the Generic Programming Paradigm in the Design of CGAL ?
- A Tool Set for Computational Experiments
- EXACUS: Efficient and Exact Algorithms for Curves and Surfaces
- Pseudo-Triangulation Workbench (ptw) User Manual
- Classroom Examples of Robustness Problems in Geometric Computations #
- Specification of the traits classes for CGAL arrangements of Efi Fogel, Dan Halperin, Ron Wein
- The CGAL Kernel: A Basis for Geometric Computation
- IST-2000-26473 Effective Computational Geometry for Curves and Surfaces
- One Sided Error Predicates in Geometric Computing
- Video: A Prototype System for Visualizing Timedependent Volume Data
- Tight Degree Bounds for Pseudo-triangulations of Points Lutz Kettner David Kirkpatrick y Bettina Speckmann y
- Designing a Data Structure for Polyhedral Surfaces Lutz Kettner \Lambda
- IST-2000-26473 Effective Computational Geometry for Curves and Surfaces
- Contour Edge Analysis for Polyhedron Projections
- SOFTWARE---PRACTICE AND EXPERIENCE Softw. Pract. Exper., 29(00), 1--38 (1999) Prepared using speauth.cls [Version: 1999/06/11 v1.1a]
- Diss. ETH No. 13325 Software Design in Computational
- Boolean Operations on 3D Selective Nef Complexes Data Structure, Algorithms, and Implementation ?
- The Safari Interface for Visualizing Timedependent Volume Data
- Using Generic Programming for Designing a Data Structure for Polyhedral Surfaces
- Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
- A Descartes Algorithm for Polynomials with Bit-Stream Coefficients
- Classroom Examples of Robustness Problems in Geometric Computations
- An Adaptable and Extensible Geometry Kernel Susan Hert1
- IST-2000-26473 Effective Computational Geometry for Curves and Surfaces
- IST-2000-26473 Effective Computational Geometry for Curves and Surfaces
- IST-2000-26473 Effective Computational Geometry for Curves and Surfaces
- On the Design of CGAL, the Computational Geometry Algorithms Library
- Reference Counting in Library Design --Optionally and with UnionFind Optimization
- Ligand Binding to the Pregnane X Receptor by Geometric Matching of Hydrogen Bonds
- Exact, E#cient, and Complete Arrangement Computation for Cubic Curves 1
- Esprit IV LTR Project 21957 (CGAL) Workpackage 4, Report 2
- An Exact, Complete and Efficient Implementation for Computing Planar Maps
- IST200026473 Effective Computational Geometry for Curves and Surfaces
- Applications of the Generic Programming Paradigm in the Design of CGAL ?
- Reference Counting in Library Design Optionally and with Union-Find Optimization
- Mathematisch Informationstheoretische
- IST200026473 Effective Computational Geometry for Curves and Surfaces
- Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
- Designing a Data Structure for Polyhedral Surfaces Lutz Kettner \Lambda , ETH Zurich, Switzerland.
- Diss. ETH No. 13325 Software Design in Computational
- ContourEdge Based Polyhedron Visualization Lutz Kettner \Lambda , UNC, Chapel Hill.
- IST200026473 Effective Computational Geometry for Curves and Surfaces
- SERIE B ---INFORMATIK A Classification Scheme of 3D Interaction
- Stxxl : Standard Template Library for XXL Roman Dementiev 1 , Lutz Kettner 2 , and Peter Sanders 1#
- Engineering a Sorted List Data Structure for 32 Bit Keys
- An Exact, Complete and Efficient Implementation for Computing Planar Maps
- Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
- An Adaptable and Extensible Geometry Kernel
- Esprit IV LTR Project 21957 (CGAL) Workpackage 4, Report 1
- Exact, Efficient, and Complete Arrangement Computation for Cubic Curves 1
- A Descartes Algorithm for Polynomials with BitStream Coefficients
- EXACUS: Efficient and Exact Algorithms for Curves and Surfaces #
- Contour Edge Analysis for Polyhedron Projections
- Complete, Exact, and Efficient Computations with Cubic Curves #
- IST200026473 E#ective Computational Geometry for Curves and Surfaces
- Tight Degree Bounds for Pseudo-triangulations of Points
