6533b82bfe1ef96bd128d724

RESEARCH PRODUCT

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

Monique TeillaudPedro Machado Manhães De CastroFrédéric CazalsSébastien Loriot

subject

Generic programmingControl and OptimizationSpheresCurved objectsGeneric programmingConstructionsComputer Science ApplicationsComputational MathematicsGeometric kernelsComputational Theory and MathematicsRobustness (computer science)cgalSPHERESGeometry and TopologyRobustnessAlgorithmPredicatesMathematics

description

AbstractThis paper presents 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.

10.1016/j.comgeo.2008.10.003http://dx.doi.org/10.1016/j.comgeo.2008.10.003