Traits Classes

Classes
class	CGAL::Arr_algebraic_segment_traits_2< Coefficient >
	The traits class Arr_algebraic_segment_traits_2 is a model of the ArrangementTraits_2 concept that handles planar algebraic curves of arbitrary degree, and \( x\)-monotone of such curves. More...
class	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Construct_curve_2
class	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Construct_point_2
class	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Construct_x_monotone_segment_2
class	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Curve_2
	Models the ArrangementTraits_2::Curve_2 concept. More...
class	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Point_2
	Models the ArrangementBasicTraits_2::Point_2 concept. More...
class	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::X_monotone_curve_2
	Models the ArrangementBasicTraits_2::X_monotone_curve_2 concept. More...
class	CGAL::Arr_Bezier_curve_traits_2< RatKernel, AlgKernel, NtTraits >
	The traits class Arr_Bezier_curve_traits_2 is a model of the ArrangementTraits_2 concept that handles planar Bézier curves. More...
class	CGAL::Arr_circle_segment_traits_2< Kernel >
	The class Arr_circle_segment_traits_2 is a model of the ArrangementTraits_2 concept and can be used to construct and maintain arrangements of circular arcs and line segments. More...
class	CGAL::Arr_circular_arc_traits_2< CircularKernel >
	This class is a traits class for CGAL arrangements, built on top of a model of concept CircularKernel. More...
class	CGAL::Arr_circular_line_arc_traits_2< CircularKernel >
	This class is a traits class for CGAL arrangements, built on top of a model of concept CircularKernel. More...
class	CGAL::Arr_conic_traits_2< RatKernel, AlgKernel, NtTraits >
	The class Arr_conic_traits_2 is a model of the ArrangementTraits_2 concept and can be used to construct and maintain arrangements of bounded segments of algebraic curves of degree \( 2\) at most, also known as conic curves. More...
class	CGAL::Arr_consolidated_curve_data_traits_2< Traits, Data >
	The class Arr_consolidated_curve_data_traits_2 is a model of the concept ArrangementTraits_2, and serves as a decorator class that enables the extension of the curve type defined by the Traits parameter. More...
class	CGAL::Arr_consolidated_curve_data_traits_2< Traits, Data >::Data_container
	The Data_container class nested within the consolidated curve-data traits and associated with the Traits::X_monotone_curve_2 type is maintained as a list with unique data objects. More...
class	CGAL::Arr_curve_data_traits_2< Tr, XData, Mrg, CData, Cnv >
	The class Arr_curve_data_traits_2 is a model of the ArrangementTraits_2 concept and serves as a decorator class that allows the extension of the curves defined by the base traits-class (the Tr parameter), which serves as a geometric traits-class (a model of the ArrangementTraits_2 concept), with extraneous (non-geometric) data fields. More...
class	CGAL::Arr_default_overlay_traits< Arrangement >
	An instance of Arr_default_overlay_traits should be used for overlaying two arrangements of type Arrangement that store no auxiliary data with their Dcel records, where the resulting overlaid arrangement stores no auxiliary Dcel data as well. More...
class	CGAL::Arr_face_overlay_traits< Arr_A, Arr_B, Arr_R, OvlFaceData >
	An instance of Arr_face_overlay_traits should be used for overlaying two arrangements of types Arr_A and Arr_B, which are instantiated using the same geometric traits-class and with the Dcel classes Dcel_A and Dcel_B respectively, in order to store their overlay in an arrangement of type Arr_R, which is instantiated using a third Dcel class Dcel_R. More...
class	CGAL::Arr_line_arc_traits_2< CircularKernel >
	This class is a traits class for CGAL arrangements, built on top of a model of concept CircularKernel. More...
class	CGAL::Arr_linear_traits_2< Kernel >
	The traits class Arr_linear_traits_2 is a model of the ArrangementTraits_2 concept, which enables the construction and maintenance of arrangements of linear objects. More...
class	CGAL::Arr_non_caching_segment_basic_traits_2< Kernel >
	The traits class Arr_non_caching_segment_basic_traits_2 is a model of the ArrangementTraits_2 concept that allow the construction and maintenance of arrangements of sets of pairwise interior-disjoint line segments. More...
class	CGAL::Arr_non_caching_segment_traits_2< Kernel >
	The traits class Arr_non_caching_segment_traits_2 is a model of the ArrangementTraits_2 concept that allows the construction and maintenance of arrangements of line segments. More...
class	CGAL::Arr_polyline_traits_2< SegmentTraits >
	The traits class Arr_polyline_traits_2 handles piecewise linear curves, commonly referred to as polylines. More...
class	CGAL::Arr_polyline_traits_2< SegmentTraits >::Push_back_2
	Functor to augment a polyline by either adding a vertex or a segment at the back. More...
class	CGAL::Arr_polyline_traits_2< SegmentTraits >::Push_front_2
	Functor to augment a polyline by either adding a vertex or a segment at the front. More...
class	CGAL::Arr_polyline_traits_2< SegmentTraits >::Make_x_monotone_2
	Cut the given curve into x-monotone sub-curves and insert them into the given output iterator. More...
class	CGAL::Arr_rational_function_traits_2< AlgebraicKernel_d_1 >
	The traits class Arr_rational_function_traits_2 is a model of the ArrangementTraits_2 concept. More...
class	CGAL::Arr_rational_function_traits_2< AlgebraicKernel_d_1 >::Construct_x_monotone_curve_2
	Functor to construct a X_monotone_curve_2. More...
class	CGAL::Arr_segment_traits_2< Kernel >
	The traits class Arr_segment_traits_2 is a model of the ArrangementTraits_2 concept, which allows the construction and maintenance of arrangements of line segments. More...

Types
enum	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Site_of_point { CGAL::Arr_algebraic_segment_traits_2< Coefficient >::POINT_IN_INTERIOR = 0, CGAL::Arr_algebraic_segment_traits_2< Coefficient >::MIN_ENDPOINT = -1, CGAL::Arr_algebraic_segment_traits_2< Coefficient >::MAX_ENDPOINT = 1 }
	Value to specify whether a point should be in the interior of a segment, or its minimal point, or its maximal point in lexicographic order. More...
typedef unspecified_type	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Polynomial_2
	the type for bivariate polynomials, with innermost coefficient type Coefficient. More...
typedef unspecified_type	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Algebraic_kernel_1
	model for the concept AlgebraicKernel_1 More...
typedef unspecified_type	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Algebraic_real_1
	represents coordinates of points. More...
typedef unspecified_type	CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Bound
	Typedef from Algebraic_kernel_1::Bound More...

Typedef Documentation

template<typename Coefficient >

typedef unspecified_type CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Algebraic_kernel_1

model for the concept AlgebraicKernel_1

template<typename Coefficient >

typedef unspecified_type CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Algebraic_real_1

represents coordinates of points.

Typedef from Algebraic_kernel_1::Algebraic_real_1

template<typename Coefficient >

typedef unspecified_type CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Bound

Typedef from Algebraic_kernel_1::Bound

template<typename Coefficient >

typedef unspecified_type CGAL::Arr_algebraic_segment_traits_2< Coefficient >::Polynomial_2

the type for bivariate polynomials, with innermost coefficient type Coefficient.

Constitutes a model of the concept Polynomial_d with two variables.

See also

CGAL::Polynomial_d

Enumeration Type Documentation

template<typename Coefficient >

enum CGAL::Arr_algebraic_segment_traits_2::Site_of_point

Value to specify whether a point should be in the interior of a segment, or its minimal point, or its maximal point in lexicographic order.

Enumerator
POINT_IN_INTERIOR
MIN_ENDPOINT
MAX_ENDPOINT