/usr/include/CGAL/Fuzzy_sphere.h is in libcgal-dev 4.11-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 | // Copyright (c) 2002,2011 Utrecht University (The Netherlands).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// You can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// 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$
// $Id$
//
//
// Author(s) : Hans Tangelder (<hanst@cs.uu.nl>)
#ifndef CGAL_FUZZY_SPHERE_H
#define CGAL_FUZZY_SPHERE_H
#include <CGAL/license/Spatial_searching.h>
#include <CGAL/Kd_tree_rectangle.h>
#include <CGAL/Search_traits_adapter.h>
#include <boost/type_traits.hpp>
#include <boost/utility/enable_if.hpp>
namespace CGAL {
namespace internal{
template <class SearchTraits,class Point_d>
class Fuzzy_sphere_impl{
SearchTraits traits;
public:
typedef typename SearchTraits::FT FT;
typedef typename SearchTraits::Dimension Dimension;
private:
Point_d c;
FT r;
FT eps;
public:
// default constructor
Fuzzy_sphere_impl(const SearchTraits& traits_=SearchTraits()):traits(traits_) {}
// constructor
Fuzzy_sphere_impl(const Point_d& center, FT radius, FT epsilon=FT(0),const SearchTraits& traits_=SearchTraits()) :
traits(traits_),c(center), r(radius), eps(epsilon)
{ // avoid problems if eps > r
if (eps>r) eps=r;
}
bool contains(const typename SearchTraits::Point_d& p) const {
// test whether the distance between c and p is less than the radius
FT squared_radius = r*r;
FT distance=FT(0);
typename SearchTraits::Construct_cartesian_const_iterator_d construct_it=
traits.construct_cartesian_const_iterator_d_object();
typename SearchTraits::Cartesian_const_iterator_d cit = construct_it(c),
pit = construct_it(p),
end = construct_it(c, 0);
for (; cit != end
&& (distance < squared_radius); ++cit, ++pit) {
distance +=
((*cit)-(*pit))*((*cit)-(*pit));
}
return (distance < squared_radius);
}
bool inner_range_intersects(const Kd_tree_rectangle<FT,Dimension>& rectangle) const {
// test whether the interior of a sphere
// with radius (r-eps) intersects 'rectangle', i.e.
// if the minimal distance of c to 'rectangle' is less than r-eps
FT distance = FT(0);
FT squared_radius = (r-eps)*(r-eps);
typename SearchTraits::Construct_cartesian_const_iterator_d construct_it=
traits.construct_cartesian_const_iterator_d_object();
typename SearchTraits::Cartesian_const_iterator_d cit = construct_it(c),
end = construct_it(c, 0);
for (int i = 0; cit != end && (distance < squared_radius); ++cit, ++i) {
if ((*cit) < rectangle.min_coord(i))
distance +=
(rectangle.min_coord(i)-(*cit))*(rectangle.min_coord(i)-(*cit));
if ((*cit) > rectangle.max_coord(i))
distance +=
((*cit)-rectangle.max_coord(i))*((*cit)-rectangle.max_coord(i));
}
return (distance < squared_radius);
}
bool outer_range_contains(const Kd_tree_rectangle<FT,Dimension>& rectangle) const {
// test whether the interior of a sphere
// with radius (r+eps) is contained by 'rectangle', i.e.
// if the maximal distance of c to the boundary of 'rectangle'
// is less than r+eps
FT distance=FT(0);
FT squared_radius = (r+eps)*(r+eps);
typename SearchTraits::Construct_cartesian_const_iterator_d construct_it=
traits.construct_cartesian_const_iterator_d_object();
typename SearchTraits::Cartesian_const_iterator_d cit = construct_it(c),
end = construct_it(c, 0);
for (int i = 0; cit != end && (distance < squared_radius) ; ++cit,++i) {
if ((*cit) <= (rectangle.min_coord(i)+rectangle.max_coord(i))/FT(2))
distance +=
(rectangle.max_coord(i)-(*cit))*(rectangle.max_coord(i)-(*cit));
else
distance += ((*cit)-rectangle.min_coord(i))*((*cit)-rectangle.min_coord(i));
}
return (distance < squared_radius);
}
}; // class Fuzzy_sphere_impl
}
template <class SearchTraits>
class Fuzzy_sphere:
public internal::Fuzzy_sphere_impl<SearchTraits,typename SearchTraits::Point_d>
{
typedef internal::Fuzzy_sphere_impl<SearchTraits,typename SearchTraits::Point_d> Base;
typedef typename Base::FT FT;
public:
// constructors
Fuzzy_sphere(const SearchTraits& traits_=SearchTraits()):Base(traits_){};
Fuzzy_sphere(const typename SearchTraits::Point_d& center, FT radius, FT epsilon=FT(0),const SearchTraits& traits_=SearchTraits()) :
Base(center,radius,epsilon,traits_) {}
};
//specialization for Search_traits_adapter
template <class K,class PM,class Base_traits>
class Fuzzy_sphere< Search_traits_adapter<K,PM,Base_traits> > :
public internal::Fuzzy_sphere_impl<Search_traits_adapter<K,PM,Base_traits>,typename Base_traits::Point_d>
{
typedef Search_traits_adapter<K,PM,Base_traits> SearchTraits;
typedef internal::Fuzzy_sphere_impl<SearchTraits,typename Base_traits::Point_d> Base;
typedef typename Base_traits::FT FT;
public:
// constructors
Fuzzy_sphere(const SearchTraits& traits_=SearchTraits()):Base(traits_){};
Fuzzy_sphere(const typename Base_traits::Point_d& center, FT radius, FT epsilon=FT(0),const SearchTraits& traits_=SearchTraits()) :
Base(center,radius,epsilon,traits_) {}
Fuzzy_sphere(const typename SearchTraits::Point_d& center, FT radius, FT epsilon=FT(0),
const SearchTraits& traits_=SearchTraits(),
typename boost::disable_if<
boost::is_same<typename Base_traits::Point_d,
typename SearchTraits::Point_d> >::type* = 0)
: Base(get(traits_.point_property_map(),center),radius,epsilon,traits_) {}
};
} // namespace CGAL
#endif // FUZZY_SPHERE_H
|