Sweeping and maintaining two-dimensional arrangements on surfaces: A first step

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

Volumn 4698 LNCS, Issue , 2007, Pages 645-656

  Berberich, Eric ^a   Fogel, Efi ^b   Halperin, Dan ^b   Mehlhorn, Kurt ^a   Wein, Ron ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETER ESTIMATION; SOFTWARE PROTOTYPING; TWO DIMENSIONAL;

PROTOTYPICAL CGAL PACKAGE; QUADRIC SURFACES;

EMBEDDED SYSTEMS;

EID: 38049077509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_57     Document Type: Conference Paper

References (16)

1. Agarwal, P.K., Sharir, M.: Arrangements and their applications. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 49-119. Elsevier, Amsterdam (2000)
2. Andrade, M.V.A., Stolfi, J.: Exact algorithms for circles on the sphere. Internat. J. Comput. Geom. Appl. 11(3), 267-290 (2001)
3. Bentley, J.L., Ottmann, T.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Computers 28(9), 643-647 (1979)
4. Berberich, E., Eigenwillig, A., Hemmer, M., Hert, S., Kettner, L., Mehlhorn, K., Reichel, J., Schmitt, S., Schömer, E., Wolpert, N.: EXACUS: Efficient and exact algorithms for curves and surfaces. In: Brodai, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 155-166. Springer, Heidelberg (2005)
5. Berberich, E., Fogel, E., Halperin, D., Mehlhorn, K., Wein, R.: A general framework for processing a set of curves defined on a continuous 2D parametric surface (2007), http://www.cs.tau.ac.il/cgal/Projects/arr.on.surf.php
6. Berberich, E., Hemmer, M., Kettner, L., Schömer, E., Wolpert, N.: An exact, complete and efficient implementation for computing planar maps of quadric intersection curves. In: Proc. 21st SCG, pp. 99-106 (2005)
7. Cazals, F., Loriot, S.: Computing the exact arrangement of circles on a sphere, with applications in structural biology. Technical Report 6049, Inria Sophia-Antipolis (2006)
8. Fogel, E., Halperin, D.: Exact and efficient construction of Minkowski sums of convex polyhedra with applications. In: Proc. 8th ALENEX (2006)
9. Fogel, E., Halperin, D., Kettner, L., Teillaud, M., Wein, R., Wolpert, N.: Arrangements. In: Boissonnat, J.-D., Teillaud, M. (eds.) Effective Computational Geometry for Curves and Surfaces, ch. 1, pp. 1-66. Springer, Heidelberg (2006)
10. Halperin, D.: Arrangements (chapter 24). In: Goodman, J.E., O'Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., ch. 24, pp. 529-562. Chapman & Hall/CRC (2004)
11. Halperin, D., Shelton, C.R.: A perturbation scheme for spherical arrangements with application to molecular modeling. Comput. Geom. Theory Appl. 10, 273-287 (1998)
12. Mehlhorn, K., Seel, M.: Infimaximal frames: A technique for making lines look like segments. J. Comput. Geom. Appl. 13(3), 241-255 (2003)
13. Meyerovitch, M.: Robust, generic and efficient construction of envelopes of surfaces in three-dimensional space. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 792-803. Springer, Heidelberg (2006)
14. Snoeyink, J., Hershberger, J.: Sweeping arrangements of curves. In: Proc. 5th SCG, pp. 354-363 (1989)
15. Wein, R., Fogel, E., Zukerman, B., Halperin, D.: 2D arrangements. In: Cgal-3.3 User and Reference Manual (2007), http://www.cgal.Org/Manual/3.3/ doc_html/cgal_manual/Arrangement.2/Chapter_main.html
16. Wein, R., Fogel, E., Zukerman, B., Halperin, D.: Advanced programming techniques applied to CGAL'S arrangement package. Comput. Geom. Theory Appl. 38(1-2), 37-63 (2007)