Kettner, L., K. Mehlhorn, S. Pion, S. Schirra and C. Yap: Classroom Examples of Robustness Problems in Geometric Computations. In: Computational Geometry - Theory and Applications 40, 1, 61-78 (2008).
doi: 10.1016/j.comgeo.2007.06.003
url: http://dx.doi.org/10.1016/j.comgeo.2007.06.003
localid: C125756E0038A185-113F896EB9E35B7AC12573E60045601C-Kettner2007Classroom
Dementiev, R., L. Kettner and P. Sanders: STXXL: standard template library for XXL data sets. In: Software - Practice & Experience 38, 6, 589-637 (2008).
doi: 10.1002/spe.844
url: http://dx.doi.org/10.1002/spe.844
localid: C125756E0038A185-07A5F0C61FEBE40AC1257576003CA5F0-Kettner2008
Hert, S., M. Hoffmann, L. Kettner, S. Pion and M. Seel: An adaptable and extensible geometry kernel. In: Computational Geometry: Theory and Applications 38, 1-2, 16-36 (2007).
doi: doi:10.1016/j.comgeo.2006.11.004
localid: C12573CC004A8E26-765A99A6A34EA3F5C12573D20002FF7C-Kettner2007CGALKernel
Fogel, E., D. Halperin, L. Kettner, M. Teillaud, R. Wein and N. Wolpert: Arrangements. In: Effective Computational Geometry for Curves and Surfaces. (Eds.) Jean-Daniel Boissonnat, Monique Teillaud. Mathematics and Visualization. Springer, Berlin, Germany (2007) 1-66.
localid: C12573CC004A8E26-E4AD242205143EECC12572630068AF3A-Kettner2007ECGBook
Hachenberger, P., L. Kettner and K. Mehlhorn: Boolean Operations on 3D Selective Nef Complexes: {Data} Structure, Algorithms, Optimized Implementation and Experiments. In: Computational Geometry: Theory and Applications 38, 1-2, 64-99 (2007).
doi: doi:10.1016/j.comgeo.2006.11.009
localid: C12573CC004A8E26-FECC77F07C1A1E72C12573D20003E1DD-Kettner2007Nef3
Berberich, E. and L. Kettner: Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point. In: Max-Planck-Institut für Informatik / Research Report MPI-I-2007-1-001. Max-Planck-Institut für Informatik, Saarbrücken, Germany (2007) 20 p..
Report Number: MPI-I-2007-1-001
Eigenwillig, A., L. Kettner and N. Wolpert: Snap rounding of Bézier curves. In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07) ACM, New York, NY, USA (2007) 158-167.
doi: 10.1145/1247069.1247101
localid: C12573CC004A8E26-100BAFC894F6C41FC125728F004F8913-Eigenwillig2007b
Eigenwillig, A., L. Kettner and N. Wolpert: Snap Rounding of Bézier Curves. In: Max-Planck-Institut für Informatik / Research Report ACS-TR-121108-01. Max-Planck-Institut für Informatik, Saarbrücken, Germany (2007) 19 p..
Report Number: ACS-TR-121108-01
Brönnimann, H., L. Kettner, M. Pocchiola and J. Snoeyink: Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. In: SIAM Journal on Computing 36, 721-739 (2006).
localid: C1256428004B93B8-512A66D02FF267B9C1257263006F7D0D-Kettner2006PseudoTEnum
Eigenwillig, A., L. Kettner, E. Schömer and N. Wolpert: Exact, Efficient and Complete Arrangement Computation for Cubic Curves. In: Computational Geometry 35, 36-73 (2006).
localid: C1256428004B93B8-9FBA65AC1148D2AEC1257176004AA8EE-eksw-eecaccc-06
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.