CGAL 4.5 - dD Geometry Kernel
|
CGAL | |
Cartesian_d | A model for Kernel_d (and even KernelWithLifting_d ) that uses Cartesian coordinates to represent the geometric objects |
Epick_d | A model for Kernel_d that uses Cartesian coordinates to represent the geometric objects |
Point_d | Point in the Euclidean space |
Homogeneous_d | A model for a Kernel_d (and even KernelWithLifting_d ) using homogeneous coordinates to represent the geometric objects |
Aff_transformation_d | An instance of the data type Aff_transformation_d<Kernel> is an affine transformation of \( d\)-dimensional space |
Direction_d | A Direction_d is a vector in the \( d\)-dimensional vector space where we forget about its length |
Hyperplane_d | An instance of data type Hyperplane_d is an oriented hyperplane in \( d\) - dimensional space |
Iso_box_d | An object \( b\) of the data type Iso_box_d is an iso-box in the Euclidean space \( \E^d\) with edges parallel to the axes of the coordinate system |
Line_d | An instance of data type Line_d is an oriented line in \( d\)-dimensional Euclidean space |
Point_d | An instance of data type Point_d<Kernel> is a point of Euclidean space in dimension \( d\) |
Ray_d | An instance of data type Ray_d is a ray in \( d\)-dimensional Euclidean space |
Segment_d | An instance \( s\) of the data type Segment_d is a directed straight line segment in \( d\)-dimensional Euclidean space connecting two points \( p\) and \( q\) |
Sphere_d | An instance \( S\) of the data type Sphere_d is an oriented sphere in some \( d\)-dimensional space |
Vector_d | An instance of data type Vector_d<Kernel> is a vector of Euclidean space in dimension \( d\) |
Linear_algebraCd | The class Linear_algebraCd serves as the default traits class for the LA parameter of CGAL::Cartesian_d<FT,LA> |
Linear_algebraHd | The class Linear_algebraHd serves as the default traits class for the LA parameter of CGAL::Homogeneous_d<RT,LA> |
Kernel_d | The concept of a kernel is defined by a set of requirements on the provision of certain types and access member functions to create objects of these types. The types are function object classes to be used within the algorithms and data structures in the basic library of CGAL. This allows you to use any model of a kernel as a traits class in the CGAL algorithms and data structures, unless they require types beyond those provided by a kernel |
Affine_rank_d | |
Affinely_independent_d | |
CartesianConstIterator_d | A type representing an iterator to the Cartesian coordinates of a point in d dimensions |
Center_of_sphere_d | |
Compare_lexicographically_d | |
Component_accessor_d | |
Compute_coordinate_d | |
ConstructCartesianConstIterator_d | |
Contained_in_affine_hull_d | |
Contained_in_linear_hull_d | |
Contained_in_simplex_d | |
Equal_d | |
Has_on_positive_side_d | |
Intersect_d | |
Less_coordinate_d | |
Less_lexicographically_d | |
Less_or_equal_lexicographically_d | |
Linear_base_d | |
Linear_rank_d | |
Linearly_independent_d | |
Midpoint_d | |
Orientation_d | |
Oriented_side_d | |
Orthogonal_vector_d | |
Point_dimension_d | |
Point_of_sphere_d | |
Point_to_vector_d | |
Side_of_bounded_sphere_d | |
Side_of_oriented_sphere_d | |
Squared_distance_d | |
Value_at_d | |
Vector_to_point_d | |
KernelWithLifting_d | The concept of a kernel with lifting is a small refinement of the general kernel concept. It adds 2 functors, the meaning of which would be unclear in kernels of fixed dimension |
Lift_to_paraboloid_d | |
Project_along_d_axis_d | |
LinearAlgebraTraits_d | The data type LinearAlgebraTraits_d encapsulates two classes Matrix , Vector and many functions of basic linear algebra. An instance of data type Matrix is a matrix of variables of type NT . Accordingly, Vector implements vectors of variables of type NT . Most functions of linear algebra are checkable, i.e., the programs can be asked for a proof that their output is correct. For example, if the linear system solver declares a linear system \( A x = b\) unsolvable it also returns a vector \( c\) such that \( c^T A = 0\) and \( c^T b \neq 0\) |
Matrix | An instance of data type Matrix is a matrix of variables of number type NT . The types Matrix and Vector together realize many functions of basic linear algebra |
Vector | An instance of data type Vector is a vector of variables of number type NT . Together with the type Matrix it realizes the basic operations of linear algebra |