Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere

Computational Geometry: Theory and Applications

Volumn 42, Issue 6-7, 2009, Pages 536-550

  De Castro, Pedro M M ^a   Cazals, Frédéric ^a   Loriot, Sébastien ^a,b   Teillaud, Monique ^a  

^a INRIA   (France)

^b UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

cgal; Constructions; Curved objects; Generic programming; Geometric kernels; Predicates; Robustness; Spheres

Indexed keywords

EID: 84867965956     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2008.10.003     Document Type: Article

References (39)

1. P. Agarwal, L. Guibas, A. Nguyen, D. Russel, and L. Zhang Collision detection for deforming necklaces Computational Geometry: Theory and Applications 28 2004 137 163
2. O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, M. Oberneder, Z. Sir, Computational and structural advantages of circular boundary representation, in: Proc. 10th International Workshop on Algorithms and Data Structures, in: Lecture Notes Comput. Sci., vol. 4619, 2007, pp. 374-385
3. N. Amenta, S. Choi, and R. Kolluri The power crust, unions of balls, and the medial axis transform Computational Geometry: Theory and Applications 19 2 2001 127 153
4. M.V.A. Andrade, and J. Stolfi Exact algorithms for circles on the sphere International Journal of Computational Geometry and Applications 11 2001 267 290
5. D. Avis, B.K. Bhattacharya, and H. Imai Computing the volume of the union of spheres The Visual Computer 3 6 1988 323 328
6. J. Bentley, and T. Ottmann Algorithms for reporting and counting geometric intersections IEEE Transactions on Computers 28 9 1979 643 647
7. E. Berberich, E. Fogel, D. Halperin, K. Mehlhorn, R. Wein, Sweeping and maintaining two-dimensional arrangements on surfaces: A first step, in: Proc. 15th European Symposium on Algorithms, in: Lecture Notes Comput. Sci., vol. 4698, 2007, pp. 645-656
8. E. Berberich, M. Hemmer, L. Kettner, E. Schömer, N. Wolpert, An exact, complete and efficient implementation for computing planar maps of quadric intersection curves, in: Proc. 21st Annual Symposium on Computational Geometry, 2005, pp. 99-106
9. K.Q. Brown Comments on Algorithms for reporting and counting geometric intersections IEEE Transactions on Computers 30 2 1981 147 148
10. C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, S. Schmitt, A separation bound for real algebraic expressions, in: Proc. 9th European Symposium on Algorithms, in: Lecture Notes Comput. Sci., vol. 2161, 2001, pp. 254-265
11. P.M.M. de Castro, F. Cazals, S. Loriot, and M. Teillaud Design of the CGAL spherical kernel and application to arrangements of circles on a sphere, Research Report 6298, INRIA, 2007 https://hal.inria.fr/inria-00173124
12. P.M.M. de Castro, S. Pion, and M. Teillaud Exact and efficient computations on circles in CGAL Abstracts 23rd European Workshop on Computational Geometry 2007 Technische Universität Graz Austria 219 222 Full version available as INRIA Research Report 6091, Exact and efficient computations on circles in CGAL and applications to VLSI design https://hal.inria.fr/inria-00123259
13. P.M.M. de Castro, M. Teillaud, 3D spherical kernel, in: CGAL Editorial Board (Ed.), CGAL User and Reference Manual. 3.4 edition
14. F. Cazals, and S. Loriot Computing the arrangement of circles on a sphere, with applications in structural biology Computational Geometry 42 6-7 2009 551 565 this issue
15. Cgal, Computational Geometry Algorithms Library http://www.cgal.org
16. F. Chazal, D. Cohen-Steiner, and Q. Mérigot Stability of boundary measure Research Report 6219, INRIA, 2007 http://hal.inria.fr/inria-00154798
17. M.L. Connolly Molecular surfaces: A review Network Science 14 1996 http://www.netsci.org/Science/Compchem/feature14.html
18. Core Number Library http://cs.nyu.edu/exact/core-pages
19. R.S. Drysdale, G. Rote, and A. Sturm Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs Computational Geometry: Theory and Applications 41 2008 31 47
20. I.Z. Emiris, A. Kakargias, S. Pion, M. Teillaud, E.P. Tsigaridas, Towards an open curved kernel, in: Proc. 20th Annual Symposium on Computational Geometry, 2004, pp. 438-446
21. Exacus, Efficient and Exact Algorithms for Curves and Surfaces http://www.mpi-inf.mpg.de/projects/EXACUS
22. E. Eyal, D. Halperin, Dynamic maintenance of molecular surfaces under conformational changes, in: Proc. 21st Annual Symposium on Computational Geometry, 2005, pp. 45-54
23. A. Fabri, S. Pion, A generic lazy evaluation scheme for exact geometric computations, in: Proc. 2nd Library-Centric Software Design, 2006, pp. 75-84
24. E. Fogel, and M. Teillaud Generic programming and the CGAL library J.-D. Boissonnat, M. Teillaud, Effective Computational Geometry for Curves and Surfaces 2006 Mathematics and Visualization Springer-Verlag 313 320
25. S. Funke, K. Mehlhorn, LOOK: A Lazy Object-Oriented Kernel for geometric computation, in: Proc. 16th Annual Symposium on Computational Geometry, 2000, pp. 156-165
26. GMP, GNU Multiple Precision Arithmetic Library http://www.swox.com/gmp
27. S. Hert, M. Hoffmann, L. Kettner, S. Pion, and M. Seel An adaptable and extensible geometry kernel Computational Geometry: Theory and Applications 38 2007 16 36
28. L. Kettner, K. Mehlhorn, S. Pion, S. Schirra, and C.K. Yap Classroom examples of robustness problems in geometric computations Computational Geometry: Theory and Applications 40 2008 61 78
29. J. Keyser, T. Culver, D. Manocha, S. Krishnan, MAPC: A library for efficient and exact manipulation of algebraic points and curves, in: Proc. 15th Annual Symposium on Computational Geometry, 1999, pp. 360-369
30. Leda, Library for Efficient Data Types and Algorithms http://www.algorithmic-solutions.com/enleda.htm
31. C. Li, S. Pion, and C.K. Yap Recent progress in exact geometric computation Journal of Logic and Algebraic Programming 64 1 2005 85 111 Special issue on the practical development of exact real number computation
32. C. Li, C.K. Yap, A new constructive root bound for algebraic expressions, in: Proc. 12th Symposium on Discrete Algorithms, 2001, pp. 496-505
33. B.J. McConkey, V. Sobolev, and M. Edelman Quantification of protein surfaces, volumes and atom-atom contacts using a constrained Voronoi procedure Bioinformatics 18 10 2002 1365 1373
34. B. Mourrain, J.-P. Técourt, and M. Teillaud On the computation of an arrangement of quadrics in 3d Computational Geometry: Theory and Applications 30 2005 145 164 Special issue, 19th European Workshop on Computational Geometry
35. S. Pion, and M. Teillaud 2D circular kernel in: CGAL Editorial Board (Ed.), CGAL User and Reference Manual. 3.2 and 3.3 edition, 2006 and 2007 http://www.cgal.org/Manual/3.3/doc-html/cgal-manual/packages.html#Pkg: CircularKernel2
36. S. Rusinkiewicz, M. Levoy, QSplat: A multiresolution point rendering system for large meshes, in: Proc. 27th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH), 2000, pp. 343-352
37. R. Wein, E. Fogel, B. Zukerman, and D. Halperin 2D arrangements in: CGAL Editorial Board (Ed.), CGAL User and Reference Manual. 3.2 and 3.3 edition, 2006 and 2007 http://www.cgal.org/Manual/3.3/doc-html/cgal-manual/packages.html#Pkg: Arrangement2
38. Worldwide Protein Data Bank http://www.wwpdb.org
39. C.K. Yap, and T. Dubé The exact computation paradigm D.-Z. Du, F.K. Hwang, Computing in Euclidean Geometry second ed. Lecture Notes Series on Computing vol. 4 1995 World Scientific Singapore 452 492