CGAL 6.2 - dD Geometry Kernel: Class and Concept List

CGAL 6.2 - dD Geometry Kernel

Loading...
Searching...
No Matches
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 123]

▼NCGAL |
C Aff_transformation_d | An instance of the data type `Aff_transformation_d<Kernel>` is an affine transformation of \( d\)-dimensional space
C Bbox_d | An object `b` of the class `Bbox_d` is a bounding box in the d-dimensional Euclidean space \( \E^d\)
C Cartesian_d | A model for `Kernel_d` (and even `KernelWithLifting_d`) that uses Cartesian coordinates to represent the geometric objects
C Direction_d | A `Direction_d` is a vector in the \( d\)-dimensional vector space where we forget about its length
▼C Epeck_d | A model for `Kernel_d`, minus `Kernel_d::Point_of_sphere_d`, that uses Cartesian coordinates to represent the geometric objects
C Cartesian_const_iterator | A bidirectional iterator over the Cartesian coordinates of a point
C Compute_power_product_d |
C Compute_squared_radius_d |
C Compute_squared_radius_smallest_orthogonal_sphere_d |
C Construct_bbox_d |
C Construct_cartesian_const_iterator_d |
C Construct_circumcenter_d |
C Construct_power_sphere_d |
C Point_d | Point in the Euclidean space
C Power_side_of_bounded_power_sphere_d |
C Side_of_bounded_sphere_d |
C Vector_d | Vector in the Euclidean space
C Weighted_point_d | Weighted point in the Euclidean space
▼C Epick_d | A model for `Kernel_d` that uses Cartesian coordinates to represent the geometric objects
C Cartesian_const_iterator | A bidirectional iterator over the Cartesian coordinates of a point
C Compute_power_product_d |
C Compute_squared_radius_d |
C Compute_squared_radius_smallest_orthogonal_sphere_d |
C Construct_bbox_d |
C Construct_cartesian_const_iterator_d |
C Construct_circumcenter_d |
C Construct_power_sphere_d |
C Point_d | Point in the Euclidean space
C Power_side_of_bounded_power_sphere_d |
C Side_of_bounded_sphere_d |
C Vector_d | Vector in the Euclidean space
C Weighted_point_d | Weighted point in the Euclidean space
C Homogeneous_d | A model for a `Kernel_d` (and even `KernelWithLifting_d`) using homogeneous coordinates to represent the geometric objects
C Hyperplane_d | An instance of data type `Hyperplane_d` is an oriented hyperplane in \( d\) - dimensional space
C 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
C Line_d | An instance of data type `Line_d` is an oriented line in \( d\)-dimensional Euclidean space
C Linear_algebraCd | The class `Linear_algebraCd` serves as the default traits class for the LA parameter of `CGAL::Cartesian_d<FT,LA>`
C Linear_algebraHd | The class `Linear_algebraHd` serves as the default traits class for the LA parameter of `CGAL::Homogeneous_d<RT,LA>`
C Point_d | An instance of data type `Point_d<Kernel>` is a point of Euclidean space in dimension \( d\)
C Ray_d | An instance of data type `Ray_d` is a ray in \( d\)-dimensional Euclidean space
C 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\)
C Sphere_d | An instance \( S\) of the data type `Sphere_d` is an oriented sphere in some \( d\)-dimensional space
C Vector_d | An instance of data type `Vector_d<Kernel>` is a vector of Euclidean space in dimension \( d\)
▼C 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
C Affine_rank_d |
C Affinely_independent_d |
C CartesianConstIterator_d | A type representing an iterator to the Cartesian coordinates of a point in `d` dimensions
C Center_of_sphere_d |
C Compare_lexicographically_d |
C Component_accessor_d |
C Compute_coordinate_d |
C Construct_max_vertex_d |
C Construct_min_vertex_d |
C ConstructCartesianConstIterator_d |
C Contained_in_affine_hull_d |
C Contained_in_linear_hull_d |
C Contained_in_simplex_d |
C Equal_d |
C Has_on_positive_side_d |
C Intersect_d |
C Less_coordinate_d |
C Less_lexicographically_d |
C Less_or_equal_lexicographically_d |
C Linear_base_d |
C Linear_rank_d |
C Linearly_independent_d |
C Midpoint_d |
C Orientation_d |
C Oriented_side_d |
C Orthogonal_vector_d |
C Point_dimension_d |
C Point_of_sphere_d |
C Point_to_vector_d |
C Side_of_bounded_sphere_d |
C Side_of_oriented_sphere_d |
C Squared_distance_d |
C Value_at_d |
C Vector_to_point_d |
▼C 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
C Lift_to_paraboloid_d |
C Project_along_d_axis_d |
C 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\)
C 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
C 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