1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
// Copyright (c) 1997 ETH Zurich (Switzerland).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under
// the terms of the Q Public License version 1.0.
// See the file LICENSE.QPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.5-branch/Min_sphere_of_spheres_d/include/CGAL/Min_sphere_of_spheres_d_traits_3.h $
// $Id: Min_sphere_of_spheres_d_traits_3.h 28567 2006-02-16 14:30:13Z lsaboret $
//
//
// Author(s) : Kaspar Fischer
#ifndef CGAL_MIN_SPHERE_OF_SPHERES_D_TRAITS_3_H
#define CGAL_MIN_SPHERE_OF_SPHERES_D_TRAITS_3_H
namespace CGAL {
template<typename K_, // kernel
typename FT_, // number type
typename UseSqrt_ = Tag_false, // whether to use square-roots
typename Algorithm_ = Default_algorithm> // algorithm to use
class Min_sphere_of_spheres_d_traits_3 {
public: // types:
typedef FT_ FT;
typedef FT_ Radius;
typedef typename K_::Point_3 Point;
typedef std::pair<Point,Radius> Sphere;
typedef typename K_::Cartesian_const_iterator_3 Cartesian_const_iterator;
typedef UseSqrt_ Use_square_roots;
typedef Algorithm_ Algorithm;
public: // constants:
static const int D = 3; // dimension
public: // accessors:
static inline const FT& radius(const Sphere& s) {
return s.second;
}
static inline Cartesian_const_iterator
center_cartesian_begin(const Sphere& s) {
return s.first.cartesian_begin();
}
};
} // namespace CGAL
#endif // CGAL_MIN_SPHERE_OF_SPHERES_D_TRAITS_3_H
|
