|
CGAL 4.7 - dD Convex Hulls and Delaunay Triangulations
|
Requirements of the first traits class to be used with the class CGAL::Delaunay_d.
CGAL::Cartesian_d<FT,LA>
CGAL::Homogeneous_d<RT,LA>
Public Member Functions | |
| DelaunayTraits_d () | |
| A default constructor and copy constructor is required. More... | |
Types | |
| typedef unspecified_type | Point_d |
| the dD point type on which the Delaunay algorithm operates More... | |
| typedef unspecified_type | Sphere_d |
| a dD sphere More... | |
| typedef unspecified_type | FT |
| an arithmetic field type More... | |
| typedef unspecified_type | Point_of_sphere_d |
Predicate object type that provides Point_d operator()(Sphere_d s, int i), which returns the \( i\)th point defining sphere s. More... | |
| typedef unspecified_type | Construct_sphere_d |
Predicate object type that provides Sphere_d operator()(int d, ForwardIterator first, ForwardIterator last), which returns a dD sphere through the points in tuple[first,last). More... | |
| typedef unspecified_type | Contained_in_simplex_d |
Predicate object type that provides bool operator()(ForwardIterator first, ForwardIterator last, Point_d p), which determines if p is contained in the closed simplex defined by the points in tuple[first,last). More... | |
| typedef unspecified_type | Squared_distance_d |
Predicate object type that provides FT operator()(Point_d p,Point_d q), which determines the squared distance from p to q. More... | |
| typedef unspecified_type | Affinely_independent_d |
Predicate object type that provides bool operator()(ForwardIterator first, ForwardIterator last), which determines if the points in tuple[first,last) are affinely independent. More... | |
Operations | |
For each of the above function and predicate object types, For example: | |
| Construct_sphere_d | construct_sphere_d_object () |
Predicate object type that provides bool operator()(ForwardIterator first, ForwardIterator last), which determines if the points in tuple[first,last) are affinely independent.
Predicate object type that provides Sphere_d operator()(int d, ForwardIterator first, ForwardIterator last), which returns a dD sphere through the points in tuple[first,last).
Predicate object type that provides bool operator()(ForwardIterator first, ForwardIterator last, Point_d p), which determines if p is contained in the closed simplex defined by the points in tuple[first,last).
| typedef unspecified_type DelaunayTraits_d::FT |
an arithmetic field type
the dD point type on which the Delaunay algorithm operates
Predicate object type that provides Point_d operator()(Sphere_d s, int i), which returns the \( i\)th point defining sphere s.
a dD sphere
Predicate object type that provides FT operator()(Point_d p,Point_d q), which determines the squared distance from p to q.
| DelaunayTraits_d::DelaunayTraits_d | ( | ) |
A default constructor and copy constructor is required.
| Construct_sphere_d DelaunayTraits_d::construct_sphere_d_object | ( | ) |