Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL

Optimal Distances
Reference Manual

Kaspar Fischer, Bernd Gärtner, Thomas Herrmann, Michael Hoffmann, and Sven Schönherr

This chapter describes concepts, classes, and functions for 2D all furthest neigbors, 3D width of a point set, and dD polytope distance.

Assertions

The optimization code uses infix OPTIMISATION in the assertions, e.g. defining the compiler flag CGAL_OPTIMISATION_NO_PRECONDITIONS switches precondition checking off, cf. Section 2.7.

67.1   Classified References Pages

All furthest neighbors

CGAL::all_furthest_neighbors_2
AllFurthestNeighborsTraits_2

Width

CGAL::Width_3<Traits>
CGAL::Width_default_traits_3<K>
WidthTraits_3

Polytope Distance

CGAL::Polytope_distance_d<Traits>
CGAL::Polytope_distance_d_traits_2<K,ET,NT>
CGAL::Polytope_distance_d_traits_3<K,ET,NT>
CGAL::Polytope_distance_d_traits_d<K,ET,NT>
PolytopeDistanceDTraits

67.2   Alphabetical List of Reference Pages

AllFurthestNeighborsTraits_2
all_furthest_neighbors_2
PolytopeDistanceDTraits
Polytope_distance_d<Traits>
Polytope_distance_d_traits_2<K,ET,NT>
Polytope_distance_d_traits_3<K,ET,NT>
Polytope_distance_d_traits_d<K,ET,NT>
WidthTraits_3
Width_3<Traits>
Width_default_traits_3<K>
Next chapter: Principal Component Analysis
Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL
CGAL Open Source Project. Release 4.0.1. 2 July 2012.