An approximate arrangement algorithm for semi-algebraic curves

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 237-245

  Milenkovic, Victor ^a   Sacks, Elisha ^b  

^a UNIVERSITY OF MIAMI   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Arrangements; Robust computational geometry

Indexed keywords

ALGEBRA; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DIGITAL ARITHMETIC; MATHEMATICAL MODELS;

ARRANGEMENTS; FLOATING POINT; NUMERICAL EQUATION SOLVER; ROBUST COMPUTATIONAL GEOMETRY;

ALGORITHMS;

EID: 33748080785     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137892     Document Type: Conference Paper

References (19)

1. E. Anderson, Z. Bai, G. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S, Hammarling, A. McKenney, and D. Sorensen. LAPACK Users' Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA, third edition, 1999.
2. Behnke, Bachmann, Fladt, and Kunle. Fundamentals of Mathematics, Volume II: Geometry. MIT Press, Cambridge, MA, 1974.
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 R. H. Möhring and R. Raman, editors, Algorithms - Esa 2002, 10th Annual European Symposium, volume 2461 of Lecture Notes in Computer Science, pages 174-186, Rome, Italy, 2002. Springer.
4. A. Eigenwillig, L. Kettner, E. Schömer, and N. Wolpert. Complete, exact, and efficient computations with cubic curves. In Proceedings of the 20th ACM Symposium on Computational Geometry, 2004.
5. E. Flato, D. Halperin, I. Hanniel, O. Nechushtan, and E. Ezra. The design and implementation of planar maps in CGAL. The ACM Journal of Experimental Algorithmics, 5(13), 2000.
6. N. Geismann, M. Hemmer, and E. Schömer. Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually! In Proceedings of the 17th ACM Symposium on Computational Geometry, pages 264-273, 2001.
7. J. Keyser, T. Culver, M. Foskey, S. Krishnan, and D. Manocha, ESOLID - a system for exact boundary evaluation. Computer-Aided Design, 36(2):175-193, 2004.
8. J. Keyser, T. Culver, D. Manocha, and S. Krishnan. Efficient and exact manipulation of algebraic points and curves. Computer Aided Design, 32:649-662, 2000.
9. K. Melhorn and S. Näher. The LEDA platform for combinatorial and geometric computing. Cambridge University Press, 1999.
10. V. Milenkovic and K. Daniels. Translational polygon containment and minimal enclosure using mathematical programming. International Transactions in Operational Research, 6:525-554, 1999.
11. V. J. Milenkovic. Rotational polygon containment and minimum enclosure using only robust 2d constructions, Computational Geometry: Theory and Applications, 13:3-19, 1999.
12. V. J. Milenkovic. Shortest path geometric rounding. Algorithmica, 27(1):57-86, 2000.
13. V. J. Milenkovic. Densest translational lattice packing of non-convex polygons. Computational Geometry: Theory and Applications, 22:205-222, 2002.
14. B. Mourrain, J.-P. Técourt, and M. Teillaud. Sweeping an arrangement of quadrics in 3d. In Proceeding of the 19th European Workshop on Computational Geometry, pages 31-34, 2003.
15. Elmar Schömer and Nicola Wolpert. An exact and efficient approach for computing a cell in an arrangement of quadrics. Computational Geometry: Theory and Application, 33:65-97, 2006.
16. H. Stetter and W. Auzinger. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. In Conference in Numerical Analysis, volume 86 of International Series on Numerical Mathematics, pages 11-30. Birkhauser, 1988.
17. R. Wein. High-level filtering for arrangements of conic arcs. In R. H. Möhring and R. Raman, editors, Algorithms - Esa 2002, 10th Annual European Symposium, volume 2461 of Lecture Notes in Computer Science, pages 884-895, Rome, Italy, 2002. Springer.
18. N. Wolpert. Jacobi curves: computing the exact topology of arrangements of non-singular algebraic curves. In Proceedings of the 11th ACM Symposium on Algorithms, pages 532-543, 2003.
19. C. Yap. Robust geometric computation. In J. E. Goodman and J, O'Rourke, editors, Handbook of discrete and computational geometry. CRC Press, Boca Raton, FL, second edition, 2004.