MPI-INF D1 Publications, generated: 20:29, 22 May 2013
Your search returned the following 40 documents:
-
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
Classroom Examples of Robustness Problems in Geometric Computations
Computational Geometry: Theory and Applications 40 (1): 61-78, 2008
-
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Michael Seel
An adaptable and extensible geometry kernel
Computational Geometry: Theory and Applications 38 (1-2): 16-36, 2007
-
Efi Fogel, Dan Halperin, Lutz Kettner, Monique Teillaud, Ron Wein, and Nicola Wolpert
Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 2007, 1-66
-
Peter Hachenberger, Lutz Kettner, and Kurt Mehlhorn
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
Computational Geometry: Theory and Applications 38 (1-2): 64-99, 2007
-
Eric Berberich and Lutz Kettner
Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point
Max-Planck-Institut für Informatik, Saarbrücken, MPI-I-2007-1-001, Research Report
-
Michael Hemmer, Susan Hert, Lutz Kettner, Sylvain Pion, and Stefan Schirra
Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3
-
Arno Eigenwillig, Lutz Kettner, and Nicola Wolpert
Snap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), Gyeongju, South Korea, 2007, 158-167
[PDF: Download: EKW-BSnap-SCG07-authprep.pdf] [PDF: Download: EKW-BSnap-SCG07-addendum.pdf]
-
Arno Eigenwillig, Lutz Kettner, and Nicola Wolpert
Snap Rounding of Bézier Curves
Max-Planck-Institut für Informatik, 66123 Saarbrücken, ACS-TR-121108-01, Technical Report
[PDF: Download: ACS-TR-121108-01.pdf]
-
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, and Jack Snoeyink
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
SIAM Journal on Computing 36 (3): 721-739, 2006
-
Eric Berberich, Franziska Ebert, and Lutz Kettner
Definition of file format for benchmark instances for arrangements of Quadrics
University of Groningen, Groningen, ACS-TR-123109-01
-
Arno Eigenwillig, Lutz Kettner, Elmar Schömer, and Nicola Wolpert
Exact, Efficient and Complete Arrangement Computation for Cubic Curves
Computational Geometry 35 (1-2): 36-73, 2006
[PDF: Download: EKSW-Cubics-CGTA-authprep.pdf]
-
Lutz Kettner
Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, San Diego, CA, USA, 2006, 34-43
-
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, Glasgow, UK, 2006, 60-60
-
Eric Berberich, Franziska Ebert, Efi Fogel, and Lutz Kettner
Web-site with benchmark instances for planar curve arrangements
University of Groningen, Groningen, ACS-TR-123108-01, Technical Report
-
Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, and Nicola Wolpert
A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, Kalamata, Greece, 2005, 138-149
[PDF: Download: AG1_003.pdf] [PDF: Download: Mehlhorn_a_2005_a.pdf]
-
Eric Berberich, Michael Hemmer, Lutz Kettner, Elmar Schömer, and Nicola Wolpert
An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), Pisa, Italy, 2005, 99-106
-
Peter Hachenberger and Lutz Kettner
Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), Cambridge, MA, USA, 2005, 163-174
-
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, and Jack Snoeyink
Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), Vancouver, BC, Canada, 2005, 98-110
-
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, and Nicola Wolpert
EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), Palma de Mallorca, Spain, 2005, 155-166
-
Lutz Kettner
Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), San Diego, CA, USA, 2005, 1-10
-
Roman Dementiev, Lutz Kettner, and Peter Sanders
STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), Palma de Mallorca, Spain, 2005, 640-651
-
Roman Dementiev, Lutz Kettner, and Peter Sanders
STXXL: Standard Template Library for XXL Data Sets
Fakultät für Informatik, University of Karlsruhe, Karlsruhe, 2005/18, Technical Report
-
Eric Berberich, Arno Eigenwillig, Ioannis Emiris, Efraim Fogel, Michael Hemmer, Dan Halperin, Athanasios Kakargias, Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Elmar Schömer, Monique Teillaud, Ron Wein, and Nicola Wolpert
An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs
Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-361200-01, Report
[PDF: Download: ECG-TR-361200-01.pdf]
-
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, Bergen, Norway, 2004, 702-713
-
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
Classroom Examples of Robustness Problems in Geometric Computations
Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-363100-01, Technical Report
-
Arno Eigenwillig, Lutz Kettner, Elmar Schömer, and Nicola Wolpert
Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), Brooklyn, New York, USA, 2004, 409-418
-
Michael Hemmer, Lutz Kettner, and Elmar Schömer
Effects of a Modular Filter on Geometric Applications
Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-363111-01, Technical Report
-
Roman Dementiev, Lutz Kettner, Jens Mehnert, and Peter Sanders
Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), New Orleans, LA, USA, 2004, 142-151
-
Lutz Kettner and Stefan Näher
Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 2004, 1435-1463
-
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Dennis Weber, and Nicola Wolpert
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces
Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-361200-02, Technical Report
-
Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, and Michael Seel
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-241100-02, Report
-
Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, and Michael Seel
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, 2003, 654-666
-
Eric Berberich, Arno Eigenwillig, Efi Fogel, Dan Halperin, Susan Hert, Lutz Kettner, Monique Teillaud, and Ron Wein
Specification of the traits classes for CGAL arrangements of curves
Effective Computational Geometry for Curves and Surfaces, {INRIA} Sophia-Antipolis, ECG-TR-241200-01, Technical Report
-
Lutz Kettner, Jarek Rossignac, and Jack Snoeyink
The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
Computational Geometry - Theory and Applications 25 (1-2): 97-116, 2003
-
Lutz Kettner, David Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, and Fumihiko Takeuchi
Tight Degree Bounds for Pseudo-triangulations of Points
Computational Geometry - Theory and Applications 25 (1-2): 3-12, 2003
-
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Michael Seel
An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), Aarhus, Denmark, August 28 - 30, 2001, 2001, 79-90
-
Matthias Bäsken, Hervé Brönnimann, Da Frank, Olivier Devillers, Ezra Ester, Andreas Fabri, Eyal Flato, Bernd Gärtner, Geert-Jan Giezeman, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Thomas Herrmann, Susan Hert, Shai Hirsch, Michael Hoffmann, Lutz Kettner, Oren Nechushtan, Gabriele Neyer, Dmitrii Pasechnik, Sylvain Pion, Stefan Schirra, Sven Schönherr, Michael Seel, Monique Teillaud, Remco Veltkamp, Ron Wein, Wieger Wesselink, and Mariette Yvinec
CGAL Reference and User Manuals
CGAL Consortium
-
Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, and Sven Schönherr
The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), Philadelphia, May, 27th-28th, 1996, 191-202
-
Hervé Brönnimann, Lutz Kettner, Stefan Schirra, and Remco Veltkamp
Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 2000, 206-216
-
Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, and Sven Schönherr
On the Design of CGAL, a computational geometry algorithms library
Software - Practice and Experience 30 (11): 1167-1202, 2000