|
The concept ConformingDelaunayTriangulationTraits_2 refines the concept ConstrainedDelaunayTriangulationTraits_2 by providing a numeric field type FT, a type Vector_2 and several constructors on Vector_2, Point_2, and a predicate on angles. The field type has to be a model of the concept SqrtFieldNumberType. This field type and the constructors are used by the conforming algorithm to compute Steiner points on constrained edges.
|
| |
|
The field type. It must be a model of
SqrtFieldNumberType, that is must be a number type
supporting the operations +, -, *, /, and √ ⋅ .
| |
|
| |
|
The vector type.
| |
|
| |
|
Constructor object. Must
provide the operator Vector_2 operator()(Point a, Point b)
that computes the vector b-a.
| |
|
| |
|
Constructor object. Must
provide the operator Vector_2 operator()(Vector_2 v, FT scale)
that computes the vector scale ⋅ v.
| |
|
| |
|
Constructor object. Must
provide the operator Point_2 operator()(Point_2 p, Vector_2 v)
that computes the point p + v.
| |
|
| |
|
Constructor object. Must provide
the operator Point_2 operator()(Point_2 a, Point_2 b) that
computes the midpoint of the segment ab.
| |
|
| |
|
Constructor object. Must
provide the operator FT operator()(Point_2 a, Point_2 b) that
computes the squared distance between a and b.
| |
|
| |
|
Predicate object. Must provide the operator
CGAL::Angle operator()(Point_2 p, Point_2 q, Point_2 r) that
returns OBTUSE, RIGHT or ACUTE depending on the angle formed by the three
points p, q, r (q being the vertex of the angle).
| |