Lutz Kettner

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Classroom examples of robustness problems in geometric computations. Comput. Geom. 40(1): 61-78 (2008)

Roman Dementiev, Lutz Kettner, Peter Sanders: STXXL: standard template library for XXL data sets. Softw., Pract. Exper. 38(6): 589-637 (2008)

Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel: An adaptable and extensible geometry kernel. Comput. Geom. 38(1-2): 16-36 (2007)

Peter Hachenberger, Lutz Kettner, Kurt Mehlhorn: Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Comput. Geom. 38(1-2): 64-99 (2007)

Arno Eigenwillig, Lutz Kettner, Nicola Wolpert: Snap rounding of Bézier curves. Symposium on Computational Geometry 2007: 158-167

Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert: Exact, efficient, and complete arrangement computation for cubic curves. Comput. Geom. 35(1-2): 36-73 (2006)

Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink: Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. SIAM J. Comput. 36(3): 721-739 (2006)

Kurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, Nicola Wolpert: A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. Reliable Implementation of Real Number Algorithms 2006

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Reply to "Backward Error Analysis ...". ICCSA (1) 2006: 60-60

Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink: Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO 2005: 98-110

Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert: A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. CASC 2005: 138-149

Eric Berberich, Michael Hemmer, Lutz Kettner, Elmar Schömer, Nicola Wolpert: An exact, complete and efficient implementation for computing planar maps of quadric intersection curves. Symposium on Computational Geometry 2005: 99-106

Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert: EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. ESA 2005: 155-166

Roman Dementiev, Lutz Kettner, Peter Sanders: : Standard Template Library for XXL Data Sets. ESA 2005: 640-651

Peter Hachenberger, Lutz Kettner: Boolean operations on 3D selective Nef complexes: optimized implementation and experiments. Symposium on Solid and Physical Modeling 2005: 163-174

Peter Hachenberger, Lutz Kettner: Boolean operations on 3D selective Nef complexes: Optimized implementation and experiments. EuroCG 2005: 139-142

Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders: Engineering a Sorted List Data Structure for 32 Bit Key. ALENEX/ANALC 2004: 142-151

Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert: Complete, exact, and efficient computations with cubic curves. Symposium on Computational Geometry 2004: 409-418

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Classroom Examples of Robustness Problems in Geometric Computations. ESA 2004: 702-713

Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi: Tight degree bounds for pseudo-triangulations of points. Comput. Geom. 25(1-2): 3-12 (2003)

Lutz Kettner, Jarek Rossignac, Jack Snoeyink: The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra. Comput. Geom. 25(1-2): 97-116 (2003)

Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel: Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. ESA 2003: 654-666

Lutz Kettner, David G. Kirkpatrick, Bettina Speckmann: Tight degree bounds for pseudo-triangulations of points. CCCG 2001: 117-120

Lutz Kettner, Jack Snoeyink: A prototype system for visualizing time-dependent volume data. Symposium on Computational Geometry 2001: 327-328

Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel: An Adaptable and Extensible Geometry Kernel. Algorithm Engineering 2001: 79-90

Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr: On the design of CGAL a computational geometry algorithms library. Softw., Pract. Exper. 30(11): 1167-1202 (2000)

Lutz Kettner: Contour-Edge Based Polyhedron Visualization. EuroCG 2000: 77-80

Lutz Kettner: Using generic programming for designing a data structure for polyhedral surfaces. Comput. Geom. 13(1): 65-90 (1999)

Lutz Kettner: Designing a Data Structure for polyhedral Surfaces. Symposium on Computational Geometry 1998: 146-154

Hervé Brönnimann, Lutz Kettner, Stefan Schirra, Remco C. Veltkamp: Applications of the Generic Programming Paradigm in the Design of CGAL. Generic Programming 1998: 206-217

Lutz Kettner, Emo Welzl: One Sided Error Predicates in Geometric Computing. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 13-26

Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr: The CGAL Kernel: A Basis for Geometric Computation. WACG 1996: 191-202