CGAL 4.7 - dD Spatial Searching: FuzzyQueryItem Concept Reference

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - dD Spatial Searching

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
FuzzyQueryItem Concept Reference
Concepts

## Definition

The concept `FuzzyQueryItem` describes the requirements for fuzzy `d`-dimensional spatial objects.

Has Models:

  `CGAL::Fuzzy_sphere<Traits>`

  `CGAL::Fuzzy_iso_box<Traits>`

## Types

typedef unspecified_type | D
| Dimension Tag.
typedef unspecified_type | Point_d
| represents a `d`-dimensional point.
typedef unspecified_type | FT
| Number type.

## Operations

bool | contains (Point_d p) const
| Test whether the query item contains `p`.
bool | inner_range_intersects (const Kd_tree_rectangle< FT, D > &rectangle) const
| Test whether the inner approximation of the spatial object intersects a rectangle associated with a node of a tree.
bool | outer_range_contains (const Kd_tree_rectangle< FT, D > &rectangle) const
| Test whether the outer approximation of the spatial object encloses the rectangle associated with a node of a tree.