Exact and efficient 2D-arrangements of arbitrary algebraic curves

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 122-131

  Eigenwillig, Arno ^a   Kerber, Michael ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENTLEY (CO); BIT STREAM (BS); ROOT-FINDING;

ALGORITHMS;

EID: 57349191885     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. J. Abbott: "Quadratic Interval Refinement for Real Roots". URL http://www.dima.unige.it/~abbott/. Poster presented at the 2006 Int. Symp. on Syrnb. and Alg. Comp. (ISSAC 2006).
2. P. K. Agarwal, M. Sharir: "Arrangements and Their Applications". In: J.-R. Sack, J. Urrutia (eds.) Handbook of Computational Geometry, 49-119. Elsevier, 2000.
3. D. S. Arnon, G. E. Collins, S. McCallum: "Cylindrical Algebraic Decomposition I+II". SI AM J. on Computing 13 (1984) 865-889. Reprinted in[14], pp. 136-165.
4. S. Basil, R. Pollack, M.-E. Roy: Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, vol. 10. Springer, 2nd edn., 2006.
5. J. L. Bentley, T. A. Ottmann: "Algorithms for Reporting and Counting Geometric Intersections". IEEE Transactions on Computers C-28 (1979) 643-647.
6. E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, L. Kettner, K. Mehlhorn, J. Reichel, S. Schmitt, E. Schömer, N. Wolpert: "EXACUS: Efficient and exact algorithms for curves and surfaces". In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), LNCS, vol. 3669. Springer, 2005 155-166.
7. E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, K. Mehlhorn, E. Schömer: "A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons". In: Proc. of the 10th Annual European Symposium on Algorithms (ESA 2002), LNCS, vol. 2461. Springer, 2002 174-186.
8. E. Berberich, E. Fogel, D. Halperin, K. Mehlhorn, R. Wein: "Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step". In: Proc. of the 15th Annual European Symposium on Algorithms (ESA 2007), 2007 lb appear in Springer LNCS.
9. E. Berberich, M. Hemmer, L. Kettner, E. Schömer, N. Wolpert: "An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves". In: Proc. of the 21st Annual Symposium on Computational Geometry (SCG 2005), 2005 99-106.
10. E. Berberich, L. Kettner: Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point. Research Report MPI-I-2007-1-001, Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany, 2007. URL http://domino.mpi-inf.mpg.de/internet/ reports. nsf/NumberView/2007-1-001.
11. C. W. Brown: "Constructing Cylindrical Algebraic Decompositions of the Plane Quickly", 2002. URL http://www.cs.usna.edu/~wcbrown/. Unpublished.
12. B. Buchberger, G. E. Collins, R. Loos (eds.): Computer Algebra: Symbolic and Algebraic Computation. Springer, 2nd edn., 1983.
13. J. Caravantes, L. Gonzalez-Vega: "Computing the Topology of an Arrangement of Quartics". In: R. R. Martin, M. A. Sabin, J. R. Winkler (eds.) IMA Conference on the Mathematics of Surfaces, LNCS, vol. 4647. Springer, 2007 104-120.
14. B. F. Caviness, J. R. Johnson (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation. Springer, 1998.
15. G. E. Collins: "Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition". In: Second GI Conference on Automata Theory and Formal Languages, LNCS, vol. 33, 1975 134-183. Reprinted in[14], pp. 85-121.
16. G. E. Collins, J. R. Johnson, W. Krandick: "Interval Arithmetic in Cylindrical Algebraic Decomposition". J. of Symbolic Computation 34 (2002) 145-157.
17. O. Devillers, A. Fronville, B. Mourrain, M. Teillaud: "Algebraic methods and arithmetic filtering for exact predicates on circle arcs". Computational Geom. 22 (2002) 119-142.
18. L. Ducos: "Optimizations of the Subresultant Algorithm". J. of Pure and Applied Algebra 145 (2000) 149-163.
19. A. Eigenwillig: "On Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives"'. J. of Computational and Applied Mathematics 200 (2007) 226-230.
20. A. Eigenwillig, M. Kerber, N. Wolpert: "Fast and Exact Geometric Analysis of Real Algebraic Plane Curves". In: C. W. Brown (ed.) Proocedings of the 2007 International Symposium on Symbolic and Algebraic Computation (ISSAC 2007). ACM, 2007 151-158.
21. A. Eigenwillig, L. Kettner, W. Krandick, K. Mehlhorn, S. Schmitt, N. Wolpert: "A Descartes Algorithm for Polynomials with Bit-Stream Coefficients". In: 8th International Workshop on Computer Algebra in Scientific Computing (CASC 2005), LNCS, vol. 3718, 2005 138-149.
22. A. Eigenwillig, L. Kettner, E. Schömer, N. Wolpert: "Exact, Efficient, and Complete Arrangement Computation for Cubic Curves". Computational Geom. 35 (2006) 36-73.
23. A. Eigenwillig, L. Kettner, N. Wolpert: "Snap Rounding of Bézier Curves". In: Proc. of the 23rd Annual Symposium on Computational Geometry (SCG 2007). ACM, 2007 158-167.
24. I. Z. Emiris, A. Kakargias, S. Pion, M. Teillaud, E. P. Tsigaridas: "Towards an Open Curved Kernel". In: Proc. of the 20th Annual Symposium on Computational Geometry (SCG 2004). ACM, 2004 438-446.
25. J. von zur Gathen, T. Lücking: "Subresultants revisited". Theoretical Computer Science (2003) 199-239.
26. K. Geddes, S. Czapor, G. Labahn: Algorithms for Computer Algebra. Kluwer, 1992.
27. C. G. Gibson: Elementary geometry of algebraic curves. Cambridge University Press, 1998.
28. L. Gonzalez-Vega, T. Recio, H. Lombardi, M.-F. Roy: "Sturm-Habicht Sequences, Determinants and Real Roots of Univariate Polynomials". In[14], pp. 300-316.
29. D. Halperin: "Arrangements". In: J. Goodman, J. O'Rourke (eds.) Handbook of Discrete and Computational Geometry, chap. 24. CRC Press, 2nd edn., 2004.
30. D. Halperin, E. Leiserowitz: "Controlled perturbation for arrangements of circles". Internat. J. of Comput. Geom. & Appl. 14 (2004) 277-310.
31. D. Halperin, C. R. Shelton: "A perturbation scheme for spherical arrangements with application to molecular modeling". Computational Geom. 10 (1998) 273-287.
32. I. Hanniel, R. Wein: "An exact, complete and efficient computation of arrangements of Bézier curves". In: Proc. of the 2007 ACM Symposium on Solid and Physical Modeling (SPM 2007). ACM, 2007 253-263.
33. J. Keyser, T. Culver, D. Manocha, S. Krishnan: "Efficient and exact manipulation of algebraic points and curves". Computer-Aided Design 32 (2000) 649-662.
34. K. Mehlhorn, S. Näher: LEDA: A platform for combinatorial and geometric computing. Cambridge Univ. Press, 1999.
35. K. Mehlhorn, R. Osbild, M. Sagraloff: "Reliable and Efficient Computational Geometry Via Controlled Perturbation". In: Automata, Languages and Programming, 33rd Internat. Colloquium (ICALP'06), Part I, LNCS, vol. 4051. Springer, 2006 299-310.
36. V. Milenkovic, E. Sacks: "An Approximate Arrangement Algorithm for Semi-algebraic Curves". Internat. J. of Comput. Geom. & Appl. 17 (2007) 175-198.
37. A. W. Strzebonski: "Cylindrical Algebraic Decomposition using validated numerics". J. of Symbolic Computation 41 (2006) 1021-1038.
38. R. J. Walker: Algebraic Curves. Princeton University Press, 1950.
39. R. Wein: "High-Level Filtering for Arrangements of Conic Arcs". In: Proc. of the 10th European Symposium on Algorithms (ESA 2002), 2002 884-895.
40. R. Wein, E. Fogel, B. Zukerman, D. Halperin: "2D Arrangements". In: CGAL-3.3 User and Reference Manual, 2007. URL http://www.cgal.org/ Manual/.
41. R. Wein, B. Zukerman: Exact and Efficient Construction of Planar Arrangements of Circular Arcs and Line Segments with Applications. Tech. Rep. ACS-TR-121200-01, Tel Aviv University, Israel, 2006.
42. N. Wolpert: "Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic Curves". In: Proc. of the 11th Annual European Symposium on Algorithms (ESA 2003), LNCS, vol. 2832. Springer, 2003 532-543.
43. C. K. Yap: Fundamental Problems of Algorithmic Algebra. Oxford University Press, 2000.
44. C. K. Yap: "Robust Geometric Computation". In: J. E. Goodman, J. O'Rourke (eds.) Handbook of Discrete and Computational Geometry, chap. 41, 927-952. CRC Press, 2nd edn., 2004.