advanced |
| |
model for FieldNumberType.
| |
| |
model for
Kernel::Point_2.
| |
| |
model for
Kernel::Less_xy_2.
| |
| |
model for
Kernel::Orientation_2.
| |
| |
AdaptableBinaryFunction class op:
Point_2 Point_2 FT.
Together with init this operation recursively defines the
objective function to maximize. Let and be two vertices
of a polygon such that precedes in the oriented
vertex chain of starting with vertex . Then
op(p,q) returns the value by which an arbitrary
sub-polygon of with vertices from increases
when is added to it. E.g. in the maximum area case this is
the area of the triangle .
|
|
| returns the minimal for which a maximal -gon can be computed. (e.g. in the maximum area case this is three.) | ||
|
| |||
returns the value of the objective function for a polygon consisting of the two points p and q. (e.g. in the maximum area case this is FT( 0).) | ||||
|
| |||
return Operation where p is the fixed point. | ||||
| ||||
|
| |||
writes the points of [points_begin, points_end) forming a min_k()-gon rooted at points_begin[0] of maximal value to o and returns the past-the-end iterator for that sequence (== o + min_k()). | ||||
|
|
|||
|
|
advanced |