|
Search the dblp DataBase
Arno Eigenwillig:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
- 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. [Citation Graph (0, 0)][DBLP] ESA, 2002, pp:174-186 [Conf]
- Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap
Almost tight recursion tree bounds for the Descartes method. [Citation Graph (0, 0)][DBLP] ISSAC, 2006, pp:71-78 [Conf]
- 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]
- Arno Eigenwillig, Michael Kerber, Nicola Wolpert
Fast and exact geometric analysis of real algebraic plane curves. [Citation Graph (0, 0)][DBLP] ISSAC, 2007, pp:151-158 [Conf]
A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. [Citation Graph (, )][DBLP]
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. [Citation Graph (, )][DBLP]
Exact and efficient 2D-arrangements of arbitrary algebraic curves. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|