CGAL 6.1.1 - Optimal Distances

Loading...
Searching...
No Matches
List of all members
AllFurthestNeighborsTraits_2 Concept Reference
Reference Manual » 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()`

Note
  `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::ComputeSquaredDistance_2`.
typedef unspecified_type | Less_xy_2
| model for `Kernel::LessXY_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 ()