Code flexibility and program efficiency by genericity: Improving CGAL'S arrangements

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

Volumn 3221, Issue , 2004, Pages 664-676

  Fogel, Efi ^a   Wein, Ron ^a   Halperin, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY;

CODE FLEXIBILITY; COMPILATION PROCESS; COMPUTATIONAL GEOMETRY ALGORITHMS; FUNDAMENTAL STRUCTURES; GENERIC PROGRAMMING; KEY OPERATIONS; PLANAR CURVES; PROGRAM EFFICIENCY;

COMPUTATIONAL GEOMETRY;

EID: 35048865304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_59     Document Type: Article

References (27)

1. The CGAL project homepage. http://www.cgal.org/.
2. The CORE library homepage. http://www.cs.nyu.edu/exact/core/.
3. The EXACUS homepage. http://www.mpi-sb.mpg.de/projects/EXACUS/.
4. Generic programming techniques. http ://www.boost.org/more/generic- programming.html.
5. The GNU MP bignum library, http://www.swox.com/gmp/.
6. The LEDA homepage. http://www.algorithmic-solutions.com/enleda.htm.
7. D. Cohen-Or, S. Lev-Yehudi, A. Karol, and A. Tal. Inner-cover of non-convex shapes. International Journal on Shape Modeling, 9(2):223-238, Dec 2003.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.
9. O. Devillers, A. Fronville, B. Mourrain, and M. Teillaud. Algebraic methods and arithmetic filtering for exact predicates on circle arcs. Comput. Geom. Theory Appl, 22(1-3):119-142, 2002.
10. D. A. Due, N. D. Ha, and L. T. Hang. Proposing a model to store and a method to edit spatial data in topological maps. Technical report, Ho Chi Minh University of Natural Sciences, Ho Chi Minh City, Vietnam, 2001.
11. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. On the design of CGAL, the Computational Geometry Algorithms Library. Software - Practice and Experience, 30:1167-1202, 2000.
12. 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, 2000.
13. Also in LNCS Vol. 1668 (WAE '99), pages 154-168.
14. E. Fogel et al. An empirical comparison of software for constructing arrangements of curved arcs. Technical Report ECG-TR-361200-01, Tel-Aviv Univ., 2004.
15. B. Gerkey. Visibility-based pursuit-evasion for searchers with limited field of view. Presented in the 2nd CGAL User Workshop (2004).
16. D. Halperin. Arrangements. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 24, pages 529-562. Chapman & Hall/CRC, 2nd edition, 2004.
17. I. Hanniel. The design and implementation of planar arrangements of curves in CGAL. M.Sc. thesis, School of Computer Science, Tel Aviv University, 2000.
18. I. Hanniel and D. Halperin. Two-dimensional arrangements in CGAL and adaptive point location for parametric curves. In LNCS Vol. 1982 (Proc. WAE '00), pages 171-182. Springer-Verlag, 2000.
19. S. Hert, M. Hoffmann, L. Kettner, S. Pion, and M. Seel. An adaptable and extensible geometry kernel. In LNCS Vol. 2141 (Proc. WAE '01), pages 79-90. Springer-Verlag, 2001.
20. S. Hirsch and D. Halperin. Hybrid motion planning: Coordinating two discs moving among polygonal obstacles in the plane. In J.-D. Boissonnat, J. Burdick, K. Goldberg, and S. Hutchinson, editors, Algorithmic Foundations of Robotics V, pages 239-255. Springer, 2003.
21. L. Kettner. Using generic programming for designing a data structure for polyhedral surfaces. Comput. Geom. Theory Appl, 13:65-90, 1999.
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/.
23. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000.
24. N. Myers. Traits: A new and useful template technique. C++ Gems, 17, 1995.
25. V. Rogol. Maximizing the area of an axially-symmetric polygon inscribed by a simple polygon. Master's thesis, Technion, Haifa, Israel, 2003.
26. S. Schirra. Robustness and precision issues in geometric computation. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 597-632. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1999.
27. R. Wein. High-level filtering for arrangements of conic arcs. In Proc. ESA 2002, pages 884-895. Springer-Verlag, 2002.