CGAL 4.7 - Optimal Distances: AllFurthestNeighborsTraits_2 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 - Optimal Distances

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

## Definition

The concept `AllFurthestNeighborsTraits_2` defines types and operations needed to compute all furthest neighbors for the vertices of a convex polygon using the function `all_furthest_neighbors_2()`.

Has Models:

  `CGAL::Cartesian<FieldNumberType>`

  `CGAL::Homogeneous<RingNumberType>`

  `CGAL::Simple_cartesian<FieldNumberType>`

  `CGAL::Simple_homogeneous<RingNumberType>`

See Also
  `CGAL::all_furthest_neighbors_2()`

Notes

- `AllFurthestNeighborsTraits_2::Less_xy_2` and `AllFurthestNeighborsTraits_2::Orientation_2` are used for (expensive) precondition checking only. Therefore, they need not to be specified, in case that precondition checking is disabled.

## Types

typedef unspecified_type | FT
| model for `FieldNumberType`.
typedef unspecified_type | Point_2
| model for `Kernel::Point_2`.
typedef unspecified_type | Compute_squared_distance_2
| model for `Kernel::Compute_squared_distance_2`.
typedef unspecified_type | Less_xy_2
| model for `Kernel::Less_xy_2`.
typedef unspecified_type | Orientation_2
| model for `Kernel::Orientation_2`.

## Operations

The following member functions return function objects of the types listed above.
Compute_squared_distance_2 | compute_squared_distance_2_object ()
Less_xy_2 | less_xy_2_object ()
Orientation_2 | orientation_2_object ()