3D spherical kernel

swMATH ID: 11156
Software Authors: de Castro, Pedro M.M.; Cazals, Fr'ed'eric; Loriot, S'ebastien; Teillaud, Monique
Description: Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere. We present a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the mathematics underlying two non-trivial predicates are presented. Second, the design of the kernel concept is developed, and the connexion between the mathematics and this design is established. In particular, we show how two different frameworks can be combined: one for the general setting, and one dedicated to the case where all the objects handled lie on a reference sphere. Finally, an assessment about the efficacy of the 3D Spherical Kernel is made through the calculation of the exact arrangement of circles on a sphere. On average while computing arrangements with few degeneracies (on sample molecular models), it is shown that certifying the result incurs a modest factor of two with respect to calculations using a plain double arithmetic.
Homepage: http://doc.cgal.org/latest/Circular_kernel_3/index.html#Chapter_3D_Spherical_Geometry_Kernel
Dependencies: CGAL
Keywords: robustness; curved objects; generic programming; spheres; predicates; constructions; geometric kernels; numerical example; CGAL kernel; algorithms; circular arcs
Related Software: 2D Arrangement; CGAL; 3D envelopes; Powercrust; Qsplat; 3D Convex Hulls; LEDA; 2D Regularized Boolean Set-Operations; 2D Minkowski sums; Halfedge Data Structures; MAPC; LOOK
Cited in: 5 Documents

Citations by Year