ExtendedKernelTraits_2

Definition

ExtendedKernelTraits_2 is a kernel concept providing extended geometry¹. Let K be an instance of the data type ExtendedKernelTraits_2. The central notion of extended geomtry are extended points. An extended point represents either a standard affine point of the Cartesian plane or a non-standard point representing the equivalence class of rays where two rays are equivalent if one is contained in the other.

Let $$R be an infinimaximal number², $$F be the square box with corners $$NW(-R,R), $$NE(R,R), $$SE(R,-R), and $$SW(-R,-R). Let $$p be a non-standard point and let $$r be a ray defining it. If the frame $$F contains the source point of $$r then let $$p(R) be the intersection of $$r with the frame $$F, if $$F does not contain the source of $$r then $$p(R) is undefined. For a standard point let $$p(R) be equal to $$p if $$p is contained in the frame $$F and let $$p(R) be undefined otherwise. Clearly, for any standard or non-standard point $$p, $$p(R) is defined for any sufficiently large $$R. Let $$f be any function on standard points, say with $$k arguments. We call $$f extensible if for any $$k points $$p₁, ..., $$p_k the function value $$f(p₁(R),...,p_k(R)) is constant for all sufficiently large $$R. We define this value as $$f(p₁,...,p_k). Predicates like lexicographic order of points, orientation, and incircle tests are extensible.

An extended segment is defined by two extended points such that it is either an affine segment, an affine ray, an affine line, or a segment that is part of the square box. Extended directions extend the affine notion of direction to extended objects.

This extended geometry concept serves two purposes. It offers functionality for changing between standard affine and extended geometry. At the same time it provides extensible geometric primitives on the extended geometric objects.

Types

Affine kernel types

Extended kernel types

Operations

Interfacing the affine kernel types

Geometric kernel calls

Point_2	K.source ( Segment_2 s)	returns the source point of s.
Point_2	K.target ( Segment_2 s)	returns the target point of s.
Segment_2	K.construct_segment ( Point_2 p, Point_2 q)
		constructs a segment pq.
int	K.orientation ( Segment_2 s, Point_2 p)
		returns the orientation of p with respect to the line through s.
int	K.orientation ( Point_2 p1, Point_2 p2, Point_2 p3)
		returns the orientation of p3 with respect to the line through p1p2.
bool	K.left_turn ( Point_2 p1, Point_2 p2, Point_2 p3)
		return true iff the p3 is left of the line through p1p2.
bool	K.is_degenerate ( Segment_2 s)	return true iff s is degenerate.
int	K.compare_xy ( Point_2 p1, Point_2 p2)
		returns the lexicographic order of p1 and p2.
int	K.compare_x ( Point_2 p1, Point_2 p2)
		returns the order on the $$x-coordinates of p1 and p2.
int	K.compare_y ( Point_2 p1, Point_2 p2)
		returns the order on the $$y-coordinates of p1 and p2.
Point_2	K.intersection ( Segment_2 s1, Segment_2 s2)
		returns the point of intersection of the lines supported by s1 and s2. Precondition:  the intersection point exists.
Direction_2	K.construct_direction ( Point_2 p1, Point_2 p2)
		returns the direction of the vector p2 - p1.
bool	K.strictly_ordered_ccw ( Direction_2 d1, Direction_2 d2, Direction_2 d3)
		returns true iff d2 is in the interior of the counterclockwise angular sector between d1 and d3.
bool	K.strictly_ordered_along_line ( Point_2 p1, Point_2 p2, Point_2 p3)
		returns true iff p2 is in the relative interior of the segment p1p3.
bool	K.contains ( Segment_2 s, Point_2 p)
		returns true iff s contains p.
bool	K.first_pair_closer_than_second ( Point_2 p1, Point_2 p2, Point_2 p3, Point_2 p4)
		returns true iff $$ p1-p2 < p3-p4 .
const char*	K.output_identifier ()	returns a unique identifier for kernel object Input/Output. Usually this should be the name of the model.

Has Models

CGAL::Extended_cartesian<FT>
CGAL::Extended_homogeneous<RT>
CGAL::Filtered_extended_homogeneous<RT>

Footnotes