Towards an open curved kernel

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 438-446

  Emiris, Ioannis Z ^a   Kakargias, Athanasios ^a   Pion, Sylvain ^b   Teillaud, Monique ^b   Tsigaridas, Elias P ^a  

^a UNIVERSITY OF ATHENS   (Greece)

^b INRIA   (France)

Author keywords

Arrangement; C++; Conic arc; Exact geometric computation

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; COMPUTER SOFTWARE; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION; POLYNOMIALS; RELIABILITY; TESTING;

ARRANGEMENT; C++ (PROGRAMMING LANGUAGE); CONIC ARC; EXACT GEOMETRIC COMPUTATION; OPEN CURVED KERNEL;

COMPUTATIONAL GEOMETRY;

EID: 4544299196     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997882     Document Type: Conference Paper

References (23)

1. M.H. Austern. Generic Programming and the STL. Addison-Wesley, 1998.
2. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in real algebraic geometry. Springer-Verlag, Berlin, 2003.
3. E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, K. Mehlhorn, and E. Schömer. A computational basis for conic arcs and boolean operations on conic polygons. In Proc. 10th European Symposium on Algorithms, vol. 2461 of Lecture Notes Comput. Sci., pages 174-186, 2002.
4. C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S. Schmitt. A separation bound for real algebraic expressions. In F. Meyer auf der Heide, editor, Proc. 9th European Symposium on Algorithms, vol. 2161 of Lecture Notes Comput. Sci., pages 254-265, 2001.
5. O. Devillers, A. Fronville, B. Mourrain, and M. Teillaud. Algebraic methods and arithmetic filtering for exact predicates on circle arcs. Comput. Geom. Theory Appl., 22:119-142, 2002.
6. A. Eigenwillig, L. Kettner, E. Schömer, and N. Wolpert. Complete, exact, and efficient computations with cubic curves. In Proc. 20th Annu. ACM Sympos. Comput. Geom., 2004.
7. I.Z. Emiris and E.P. Tsigaridas. Methods to compare real roots of polynomials of small degree. Tech. Report ECG-TR-242200-01, INRIA Sophia-Antipolis, 2003.
8. I.Z. Emiris and E.P. Tsigaridas. Comparison of fourth-degree algebraic numbers and applications to geometric predicates. Tech. Report ECG-TR-302206-03, INRIA Sophia-Antipolis, 2003. Final version submitted for publication.
9. E. Fogel, D. Halperin, R. Wein, M. Teillaud, E. Berberich, A. Eigenwillig, S. Hert, and L. Kettner. Specification of the traits classes for cgal arrangements of curves. Tech. Report ECG-TR-241200-01, INRIA Sophia-Antipolis, 2003.
10. G. Gatellier, B. Mourrain, and J.-P. Pavone. Axel: Algebraic software component for geometric modeling, 2003. INRIA Sophia-Antipolis, Manuscript.
11. N. Geismann, M. Hemmer, and E. Schemer. Computing a 3-dimensional cell in an arrangement of quadrics: Exactly and actually! In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 264-273, 2001.
12. L. Guibas, M. Karavelas, and D. Russel. A computation framework for handling motion. In Proc. ALENEX, 2004. To appear.
13. S. Hert, M. Hoffmann, L. Kettner, S. Pion, and M. Seel. An adaptable and extensible geometry kernel. In Proc. Workshop on Algorithm Engineering, vol. 2141 of Lecture Notes Comput. Sci., pages 79-90. Springer-Verlag, 2001.
14. M.I. Karavelas and I.Z. Emiris. Root comparison techniques applied to computing the additively weighted Voronoi diagram. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 320-329, 2003. Final version to appear in Comp. Geometry: Theory & Appl..
15. M.I. Karavelas and I.Z. Emiris. Root comparison techniques applied to computing the additively weighted Voronoi diagram. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 320-329, 2003. Final version to appear in Comp. Geometry: Theory & Appl..
16. C. Li and C. Yap. A new constructive root bound for algebraic expressions. In 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan. 2001.
17. B. Mourrain, J.-P. Técourt, and M. Teillaud. Predicates for the sweeping of an arrangement of quadrics in 3d. Tech. Report ECG-TR-242205-01, INRIA Sophia-Antipolis, 2003.
18. S. Pion and M. Teillaud. Towards a cgal-like kernel for curves. Tech. Report ECG-TR-302206-01, MPI Saarbrücken, INRIA Sophia-Antipolis, 2003.
19. T. Sederberg and G.Z. Chang. Isolating the real roots of polynomials using isolator polynomials. In C. Bajaj, editor, Algebraic Geometry and Applications, Spec. Issue of Symp. on occasion of S. Abhyankar's 60th Birthday. Springer Verlag, 1993.
20. R. Wein. High-level filtering for arrangements of conic arcs. In Proc. 10th European Symposium on Algorithms, vol. 2461 of Lecture Notes Comput. Sci., pages 884-895, 2002.
21. R. Wein. Cgal based implementation of arrangements of conic arcs. Tech. Report ECG-TR-241210-01, Tel-Aviv University, 2003.
22. N. Wolpert. Jacobi curves: Computing the exact topology of non-singular algebraic curves. In G.D. Battista and U. Zwick, editors, Proc. 11th European Symp. Algorithms, vol. 2832 of Lecture Notes Comput. Sci., pages 532-543, 2003.
23. C. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, New York, 2000.