Two-dimensional arrangements in CGAL and adaptive point location for parametric curves

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

Volumn 1982 LNCS, Issue , 2001, Pages 171-182

  Hanniel, Iddo ^a   Halperin, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER VISION; COMPUTER GRAPHICS;

IN-FIELD; PARAMETRIC CURVE; POINT LOCATION;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 84896756067     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44691-5_15     Document Type: Conference Paper

References (23)

1. N. Amenta. Directory of computational geometry software. http://www.geom.umn.edu/software/cglist/.
2. N. Amenta. Computational geometry software. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 52, pages 951-960. CRC Press LLC, Boca Raton, FL, 1997.
3. M. Austern. Generic Programming and the STL - Using and Extending the C++ Standard Template Library. Addison-Wesley, 1999.
4. H. Brönniman, L. Kettner, S. Schirra, and R. Veltkamp. Applications of the generic programming paradigm in the design of CGAL. Technical Report MPI-I-98-1-030, Max-Planck-Insitut für Informatik, 66123 Saarbrücken, Germany, 1998.
5. The CGAL User Manual, Version 2.1, Jan. 2000. http://www.cs.uu.nl/CGAL.
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Heidelberg, Germany, 1997.
7. H. Edelsbrunner. Algorithms in Combinatorial Geometry, Volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
8. A. Fabri, G. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. The CGAL kernel: A basis for geometric computation. In M. C. Lin and D. Manocha, editors, Proc. 1st ACM Workshop on Appl. Comput. Geom., Volume 1148 of Lecture Notes Comput. Sci., pages 191-202. Springer-Verlag, 1996.
9. G. Farin. Curves and Surfaces for Computer Aided Geometric Design. Academic Press, 3rdedition, 1993.
10. E. Flato, D. Halperin, I. Hanniel, and O. Nechushtan. The design and implementation of planar maps in CGAL. In Proc. of the 3rd Workshop of Algorithm Engineering, Volume 1668 of Lecture Notes Comput. Sci., pages 154-168. Springer-Verlag, 1999.
11. 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.
12. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns - Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.
13. M. Goldwasser. An implementation for maintaining arrangements of polygons. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages C32-C33, 1995.
14. M. Goodrich, L. J. Guibas, J. Hershberger, and P. Tanenbaum. Snap rounding line segments efficiently in two and three dimensions. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 284-293, 1997.
15. 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.
16. 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. Forthcoming, http://www.math.tau.ac.il/hanniel/ARRG00/.
17. 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/.
18. K. Mehlhorn, S. Näher, C. Uhrig, and M. Seel. The LEDA User Manual, Version 4.1. Max-Planck-Insitut für Informatik, 66123 Saarbrücken, Germany, 2000.
19. K. Melhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
20. M. Neagu and B. Lacolle. Computing the combinatorial structure of arrangements of curves using polygonal approximations. Manuscript. A preliminary version appearedin Proc. 14th European Workshop on Computational Geometry, 1998.
21. M. Sharir and P. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, 1995.
22. J. R. Shewchuk. Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete Comput. Geom., 18(3):305-363, 1997.
23. S. Skiena. The Algorithm Design Manual. Telos/Springer-Verlag, 1997. http://www.cs.sunysb.edu/~algorith/index.html.