The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lutz Kettner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders
    Engineering a Sorted List Data Structure for 32 Bit Key. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:142-151 [Conf]
  2. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
    Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:98-110 [Conf]
  3. Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert
    A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. [Citation Graph (0, 0)][DBLP]
    CASC, 2005, pp:138-149 [Conf]
  4. Lutz Kettner, David G. Kirkpatrick, Bettina Speckmann
    Tight degree bounds for pseudo-triangulations of points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:117-120 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:99-106 [Conf]
  6. Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert
    Complete, exact, and efficient computations with cubic curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:409-418 [Conf]
  7. Lutz Kettner
    Designing a Data Structure for polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:146-154 [Conf]
  8. Lutz Kettner, Jack Snoeyink
    A prototype system for visualizing time-dependent volume data. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:327-328 [Conf]
  9. Arno Eigenwillig, Lutz Kettner, Nicola Wolpert
    Snap rounding of Bézier curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:158-167 [Conf]
  10. Hervé Brönnimann, Lutz Kettner, Stefan Schirra, Remco C. Veltkamp
    Applications of the Generic Programming Paradigm in the Design of CGAL. [Citation Graph (0, 0)][DBLP]
    Generic Programming, 1998, pp:206-217 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:155-166 [Conf]
  12. Roman Dementiev, Lutz Kettner, Peter Sanders
    : Standard Template Library for XXL Data Sets. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:640-651 [Conf]
  13. Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel
    Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:654-666 [Conf]
  14. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
    Classroom Examples of Robustness Problems in Geometric Computations. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:702-713 [Conf]
  15. Lutz Kettner
    Contour-Edge Based Polyhedron Visualization. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:77-80 [Conf]
  16. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap
    Reply to "Backward Error Analysis ...". [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2006, pp:60-60 [Conf]
  17. Lutz Kettner, Emo Welzl
    One Sided Error Predicates in Geometric Computing. [Citation Graph (0, 0)][DBLP]
    IFIP Congress: Fundamentals - Foundations of Computer Science, 1998, pp:13-26 [Conf]
  18. Peter Hachenberger, Lutz Kettner
    Boolean operations on 3D selective Nef complexes: optimized implementation and experiments. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid and Physical Modeling, 2005, pp:163-174 [Conf]
  19. Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr
    The CGAL Kernel: A Basis for Geometric Computation. [Citation Graph (0, 0)][DBLP]
    WACG, 1996, pp:191-202 [Conf]
  20. Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
    An Adaptable and Extensible Geometry Kernel. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:79-90 [Conf]
  21. Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert
    Exact, efficient, and complete arrangement computation for cubic curves. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:35, n:1-2, pp:36-73 [Journal]
  22. Lutz Kettner
    Using generic programming for designing a data structure for polyhedral surfaces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:1, pp:65-90 [Journal]
  23. Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
    Tight degree bounds for pseudo-triangulations of points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:3-12 [Journal]
  24. Lutz Kettner, Jarek Rossignac, Jack Snoeyink
    The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:97-116 [Journal]
  25. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
    Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:721-739 [Journal]
  26. Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr
    On the design of CGAL a computational geometry algorithms library. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2000, v:30, n:11, pp:1167-1202 [Journal]
  27. Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
    An adaptable and extensible geometry kernel. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:1-2, pp:16-36 [Journal]
  28. Peter Hachenberger, Lutz Kettner, Kurt Mehlhorn
    Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:1-2, pp:64-99 [Journal]

  29. A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. [Citation Graph (, )][DBLP]


  30. Boolean operations on 3D selective Nef complexes: Optimized implementation and experiments. [Citation Graph (, )][DBLP]


  31. Classroom examples of robustness problems in geometric computations. [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002