Complete, exact, and efficient computations with cubic curves

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 409-418

  Eigenwillig, Arno ^a   Schömer, Elmar ^b   Kettner, Lutz ^a   Wolpert, Nicola ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

Algebraic curves; Arrangements; Computational geometry; Exact geometric computation; Robustness; Sweep line algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; POLYNOMIALS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

ALGEBRAIC CURVES; EXACT GEOMETRIC COMPUTATION; SWEEP-LINE ALGORITHMS;

COMPUTER SCIENCE;

EID: 4544290536     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997879     Document Type: Conference Paper

References (32)

1. S. Abhyankar and C. Bajaj. Computations with algebraic curves. In ISSAC '88, LNCS 358, pages 274-284. Springer, 1989.
2. P. K. Agarwal and M. Sharir. Arrangements and their applications. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 49-119. Elsevier, 2000.
3. J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28(9):643-647, Sept. 1979.
4. 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 ESA'02, LNCS 2461, pages 174-186. Springer, 2002.
5. E. Brieskorn and H. Knörrer. Plane Algebraic Curves. Birkhäuser, Basel, 1986.
6. C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. A strong and easily computable separation bound for arithmetic expressions involving radicals. Algorithmica, 27(1):87-99, 2000.
7. C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S. Schmitt. A separation bound for real algebraic expressions. In ESA '01, LNCS 2161, pages 254-265. Springer, 2001.
8. J. Canny. The Complexity of Robot Motion Planning. ACM - MIT Press Doctoral Dissertation Award Series. MIT Press, Cambridge, MA, 1987.
9. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proc. end GI Conf. on Automata Theory and Formal Languages, LNCS 33, pages 134-183. Springer, 1975.
10. G. E. Collins and R. Loos. Real zeros of polynomials. In B. Buchberger, G. E. Collins, and R. Loos, editors, Computer Algebra: Symbolic and Algebraic Computation, pages 83-94. Springer-Verlag, New York, NY, 1982.
11. CORE library project. http://www.cs.nyu.edu/exact/core/.
12. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Springer-Verlag, New York, 2nd edition, 1997.
13. O. Devillers, A. Fronville, B. Mourrain, and M. Teillaud. Algebraic methods and arithmetic filtering for exact predicates on circle arcs. In Proc. 16th Annu. ACM Symp. Comput. Geom., pages 139-147, 2000.
14. A. Eigenwillig. Exact arrangement computation for cubic curves. Master's thesis, Saarland University, Saarbrücken, Germany, 2003.
15. I. Emiris, A. Kakargias, S. Pion, M. Teillaud, and E. Tsigaridas. Towards an open curved kernel. In Proc. 20th Annu. ACM Sympos. Comput. Geom., 2004.
16. I. Z. Emiris and E. P. Tsigaridas. Comparison of fourth-degree algebraic numbers and applications to geometric predicates (revised version). Report ECG-TR-302206-03, Oct. 2003. http://www-sop.inria.fr/prisme/ECG/Results/.
17. E. Flato, D. Halperin, I. Hanniel, O. Nechushtan, and E. Ezra. The design and implementation of planar maps in CGAL. ACM J. of Exper. Algor., 5, 2000.
18. K. O. Geddes, S. R. Czapor, and G. Labahn. Algorithms for Computer Algebra. Kluwer, 1992.
19. N. Geismann, M. Hemmer, and E. Schömer. Computing a 3-dimensional cell in an arrangement of quadrics: Exactly and actually! In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 264-271, 2001.
20. C. G. Gibson. Elementary Geometry of Algebraic Curves. Cambridge University Press, 1998.
21. D. Halperin. Arrangements. In J. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 24. CRC Press LLC, Boca Raton, FL, 2nd edition, 2004.
22. H. Hong. Efficient method for analyzing topology of plane real algebraic curves. In Proceedings of IMACS-SC 93, (Lille, France), June 1993.
23. J. Keyser, T. Culver, D. Manocha, and S. Krishnan. MAPC: A library for efficient and exact manipulation of algebraic points and curves. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 360-369, 1999.
24. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000.
25. P. Pedersen. Multivariate sturm theory. In Proceedings of Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pages 318-323, 1991.
26. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer, New York, NY, 1985.
27. T. Sakkalis. The topological configuration of a real algebraic curve. Bulletin of the Australian Mathematical Society, 43:37-50, 1991.
28. M. Seel. Implementation of planar Nef polyhedra. Report MPI-I-2001-1-003, MPI für Informatik, 66123 Saarbrücken, Germany, Aug. 2001.
29. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
30. R. Wein. High level filtering for arrangements of conic arcs. In ESA'02, LNCS 2461, pages 884-895. Springer, 2002.
31. N. Wolpert. An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics. PhD thesis, Saarland University, Saarbrücken, Germany, 2002.
32. N. Wolpert. Jacobi curves: Computing the exact topology of arrangements of non-singular algebraic curves. In ESA '03, LNCS 2832, pages 532-543. Springer, 2003.