Your search returned the following 18 documents:

18. Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
    Arno Eigenwillig and Michael Kerber
    In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), San Francisco, USA, 2008, 122-131
    [PDF: Download: ek-arrangements-2008-authprep.pdf]
    
17. Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
    Arno Eigenwillig
    Doctoral dissertation, Universität des Saarlandes, 2008
    
16. Fast and Exact Geometric Analysis of Real Algebraic Plane Curves
    Arno Eigenwillig, Michael Kerber, and Nicola Wolpert
    In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, Waterloo, Ontario, Canada, 2007, 151-158
    [PDF: Download: ekw-fast-2007-authprep.pdf]
    
15. On Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
    Arno Eigenwillig
    Journal of Computational and Applied Mathematics 200 (1): 226-230, 2007
    
    
14. Snap rounding of Bézier curves
    Arno Eigenwillig, Lutz Kettner, and Nicola Wolpert
    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]
    
13. Snap Rounding of Bézier Curves
    Arno Eigenwillig, Lutz Kettner, and Nicola Wolpert
    Max-Planck-Institut für Informatik, 66123 Saarbrücken, ACS-TR-121108-01, Technical Report
    [PDF: Download: ACS-TR-121108-01.pdf]
    
12. Almost Tight Recursion Tree Bounds for the Descartes Method
    Arno Eigenwillig, Vikram Sharma, and Chee K. Yap
    In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, Genova, Italy, 2006, 71-78
    [PDF: Download: ESY-DescTree-ISSAC06-authprep.pdf]
    
11. Exact, Efficient and Complete Arrangement Computation for Cubic Curves
    Arno Eigenwillig, Lutz Kettner, Elmar Schömer, and Nicola Wolpert
    Computational Geometry 35 (1-2): 36-73, 2006
    [PDF: Download: EKSW-Cubics-CGTA-authprep.pdf]
    
10. A Descartes algorithm for polynomials with bit-stream coefficients
    Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, and Nicola Wolpert
    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]
    
9. Certifying Algorithms (draft)
   Kurt Mehlhorn, Arno Eigenwillig, Kanela Kaligosi, Dieter Kratsch, Ross McConnell, Ulrich Meyer, and Jeremy P. Spinrad
   . Note: draft
   
8. EXACUS: Efficient and exact algorithms for curves and surfaces
   Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, and Nicola Wolpert
   In: 13th Annual European Symposium on Algorithms (ESA 2005), Palma de Mallorca, Spain, 2005, 155-166
   
   
7. An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs
   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
   Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-361200-01, Report
   [PDF: Download: ECG-TR-361200-01.pdf]
   
6. Complete, Exact and Efficient Computations with Cubic Curves
   Arno Eigenwillig, Lutz Kettner, Elmar Schömer, and Nicola Wolpert
   In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), Brooklyn, New York, USA, 2004, 409-418
   
5. EXACUS: Efficient and Exact Algorithms for Curves and Surfaces
   Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Dennis Weber, and Nicola Wolpert
   Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-361200-02, Technical Report
   
4. Exact Arrangement Computation for Cubic Curves
   Arno Eigenwillig
   Master's thesis, Universität des Saarlandes, 2003
   [PDF: Download: arno_thesis_2003.pdf]
   
3. Specification of the traits classes for CGAL arrangements of curves
   Eric Berberich, Arno Eigenwillig, Efi Fogel, Dan Halperin, Susan Hert, Lutz Kettner, Monique Teillaud, and Ron Wein
   Effective Computational Geometry for Curves and Surfaces, {INRIA} Sophia-Antipolis, ECG-TR-241200-01, Technical Report
   
2. A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
   Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, and Elmar Schömer
   In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, 2002, 174-186
   
   
1. Sweeping Arrangements of Cubic Segments Exactly and Efficiently
   Arno Eigenwillig, Elmar Schömer, and Nicola Wolpert
   Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-182202-01, Report