CGAL 4.3 - dD Spatial Searching
|
#include <CGAL/Fuzzy_sphere.h>
The class Fuzzy_sphere
implements fuzzy d
-dimensional spheres.
A fuzzy sphere with radius \( r\) and fuzziness value \( \epsilon\) has as outer approximation a sphere with radius \( r+\epsilon\) and as inner approximation a sphere with radius \( r-\epsilon\).
Parameters
Expects for the template argument a model of the concept SearchTraits
, for example CGAL::Cartesian_d<double>
.
FuzzyQueryItem
Types | |
typedef Traits::Point_d | Point_d |
Point type. | |
typedef Traits::FT | FT |
Number type. | |
Creation | |
Fuzzy_sphere (Point_d center, FT radius, FT epsilon=FT(0), Traits t=Traits()) | |
Constructs a fuzzy sphere centered at center with radius radius and fuzziness value epsilon . | |
Fuzzy_sphere (Traits::Base::Point_d center, FT radius, FT epsilon=FT(0), Traits t=Traits()) | |
Constructs a fuzzy sphere centered at center with radius radius and fuzziness value epsilon . More... | |
Operations | |
bool | contains (const Point_d &p) const |
test whether the fuzzy sphere contains p . | |
bool | inner_range_intersects (const Kd_tree_rectangle< FT > &rectangle) const |
test whether the inner sphere intersects the rectangle associated with a node of a tree. | |
bool | outer_range_contains (const Kd_tree_rectangle< FT > &rectangle) const |
test whether the outer sphere encloses the rectangle associated with a node of a tree. | |
CGAL::Fuzzy_sphere< Traits >::Fuzzy_sphere | ( | Traits::Base::Point_d | center, |
FT | radius, | ||
FT | epsilon = FT(0) , |
||
Traits | t = Traits() |
||
) |
Constructs a fuzzy sphere centered at center
with radius radius
and fuzziness value epsilon
.
Traits
is Search_traits_adapter<Key,PointPropertyMap,BaseTraits>
.