High-Level Filtering for arrangements of conic arcs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 884-896

  Wein, Ron ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGEBRAIC NUMBERS; COMPUTATIONAL GEOMETRY ALGORITHMS; CONIC ARCS; CONSTRUCTION HISTORY; GEOMETRIC ALGORITHM; KEEP TRACK OF;

COMPUTATIONAL GEOMETRY;

EID: 84938076522     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_76     Document Type: Conference Paper

References (28)

1. The OGAL project. http://www.cgal.org/. 885
2. The CORE library homepage. http://www.cs.nyu.edu/exact/core/. 886
3. The LEDA homepage. http://www.mpi-sb.mpg.de/LEDA/. 886
4. P. K. Agarwal, E. Flato, and D. Halperin. Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. Theory Appl., 21:39-61, 2002. 887
5. P. K. Agarwal, R. Klein, C. Knauer, and M. Sharir. Computing the detour of polygonal curves. Technical Report B 02-03, Freie Universitat Berlin, Fachbereich Mathematik und Informatik, 2002. 887
6. Y. Aharoni, D. Halperin, I. Hanniel, S. Har-Peled, and C. Linhart. On-line zone construction in arrangements of lines in the plane. In Proc. of the 3rd Workshop of Algorithm Engineering, volume 1668 of Lecture Notes Comput. Sci., pages 139-153. Springer-Verlag, 1999. 887
7. T. Andres. Specification and implementation of a conic class for CGAL. M.Sc. thesis, Institute for Theoretical Computer Science, Swiss Federal Institute of Technology (ETH) Zurich, 8001 Zurich, Switzerland, 1999. 886
8. H. Bronnimann, C. Burnikel, and S. Pion. Interval arithmetic yields efficient arithmetic filters for computational geometry. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 165-174, 1998. 886
9. C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S. Schmitt. A separation bound for real algebraic expressions. In Proc. ESA 2001, pages 254-265, 2001. 889
10. The CGAL User Manual, Release 2.3, 2001. www.cgal.org. 888
11. O. Devillers, A. Fronville, B. Mourrain, and M. Teillaud. Exact predicates for circle arcs arrangements. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 139-147, 2000. 886
12. G. Elber and M.-S. Kim, editors. Special Issue of Computer Aided Design: Offsets, Sweeps and Minkowski Sums, volume 31. 1999. 887
13. S. Fortune and C. J. van Wyk. Static analysis yields efficient exact integer arithmetic for computational geometry. ACM Trans. Graph., 15(3):223-248, July 1996. 886
14. S. Funke and K. Mehlhorn. LOOK: A lazy object-oriented kernel for geometric computation. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 156-165, 2000 886
15. 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-273, 2001. 886
16. M. Goldwasser. An implementation for maintaining arrangements of polygons. InProc. 11th Annu. ACM Sympos. Comput. Geom., pages C32-C33, 1995. 887
17. D. Halperin. Arrangements. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 21, pages 389-412. CRC Press LLC, Boca Raton, FL, 1997. 884
18. I. Hanniel. The design and implementation of planar arrangements of curves in CGAL. M.Sc. thesis, Dept. Comput. Sci., Tel Aviv University, Tel Aviv, Israel, 2000. 886
19. V. Karamcheti, C. Li, I. Pechtchanski, and C. Yap. A core library for robust numeric and geometric computation. In 15th ACM Symp. on Computational Geometry, 1999, pages 351-359, 1999. 886
20. M. Karasick, D. Lieber, and L. R. Nackman. Efficient Delaunay triangulations
21. using rational arithmetic. ACM Trans. Graph., 10(1):71-91, Jan. 1991. 886
22. J. Keyser, T. Culver, D. Manocha, and S. Krishnan. MAPC: a library for efficient manipulation of algebraic points and curves. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 360—369, 1999. http://www.cs.unc.edu/~geom/MAPC/. 886
23. C. Li and C. Yap. A new constructive root bound for algebraic expressions. In 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 496-505, 2001. 889
24. R. Loos. Computing in algebraic extensions. In B. Buchberger, G. E. Collins, R. Loos, and R. Albrecht, editors, Computer Algebra: Symbolic and Algebraic Computation, pages 173-187. Springer-Verlag, 1983. 892
25. K. Melhorn and S. Nöaher. The LEDA Platform ofCombinatorial and Geometric Computing. Cambridge University Press, 1999. 886
26. K. Mulmuley. A fast planar partition algorithm, I. J. Symbolic Comput., 10(3-4):253-280, 1990. 885
27. S. Schirra. Robustness and precision issues in geometric computation. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 597632. Elsevier Science Publishers B. V. North-Holland, Amsterdam, 1999. 886
28. R. Wein. High-Level Filtering for Arrangements of Conic Arcs. M.Sc. thesis, Dept. Comput. Sci., Tel Aviv University, Tel Aviv, Israel, 2002 (to appear). 888, 890, 892