 | 2008 |
|---|
| 11 |       | Arno Eigenwillig,
Michael Kerber:
Exact and efficient 2D-arrangements of arbitrary algebraic curves.
SODA 2008: 122-131 |
| 10 | | Arno Eigenwillig,
Kurt Mehlhorn:
Multiplikation langer Zahlen (schneller als in der Schule).
Taschenbuch der Algorithmen 2008: 109-118 |
| 2007 |
|---|
| 9 | | Arno Eigenwillig,
Michael Kerber,
Nicola Wolpert:
Fast and exact geometric analysis of real algebraic plane curves.
ISSAC 2007: 151-158 |
| 8 | | Arno Eigenwillig,
Lutz Kettner,
Nicola Wolpert:
Snap rounding of Bézier curves.
Symposium on Computational Geometry 2007: 158-167 |
| 2006 |
|---|
| 7 | | Arno Eigenwillig,
Vikram Sharma,
Chee-Keng Yap:
Almost tight recursion tree bounds for the Descartes method.
ISSAC 2006: 71-78 |
| 6 | | 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 |
| 5 | | 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) |
| 2005 |
|---|
| 4 | | 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 |
| 3 | | 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 |
| 2004 |
|---|
| 2 | | Arno Eigenwillig,
Lutz Kettner,
Elmar Schömer,
Nicola Wolpert:
Complete, exact, and efficient computations with cubic curves.
Symposium on Computational Geometry 2004: 409-418 |
| 2002 |
|---|
| 1 | | Eric Berberich,
Arno Eigenwillig,
Michael Hemmer,
Susan Hert,
Kurt Mehlhorn,
Elmar Schömer:
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons.
ESA 2002: 174-186 |
