\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.12 - dD Geometry Kernel

Classes

class  Kernel_d::Affine_rank_d
 
class  Kernel_d::Affinely_independent_d
 
class  Kernel_d::CartesianConstIterator_d
 A type representing an iterator to the Cartesian coordinates of a point in d dimensions. More...
 
class  Kernel_d::Center_of_sphere_d
 
class  Kernel_d::Compare_lexicographically_d
 
class  Kernel_d::Component_accessor_d
 
class  Kernel_d::Compute_coordinate_d
 
class  Kernel_d::Construct_max_vertex_d
 
class  Kernel_d::Construct_min_vertex_d
 
class  Kernel_d::ConstructCartesianConstIterator_d
 
class  Kernel_d::Contained_in_affine_hull_d
 
class  Kernel_d::Contained_in_linear_hull_d
 
class  Kernel_d::Contained_in_simplex_d
 
class  Kernel_d::Equal_d
 
class  Kernel_d::Has_on_positive_side_d
 
class  Kernel_d::Intersect_d
 
class  Kernel_d::Less_coordinate_d
 
class  Kernel_d::Less_lexicographically_d
 
class  Kernel_d::Less_or_equal_lexicographically_d
 
class  KernelWithLifting_d::Lift_to_paraboloid_d
 
class  Kernel_d::Linear_base_d
 
class  Kernel_d::Linear_rank_d
 
class  Kernel_d::Linearly_independent_d
 
class  Kernel_d::Midpoint_d
 
class  Kernel_d::Orientation_d
 
class  Kernel_d::Oriented_side_d
 
class  Kernel_d::Orthogonal_vector_d
 
class  Kernel_d::Point_dimension_d
 
class  Kernel_d::Point_of_sphere_d
 
class  Kernel_d::Point_to_vector_d
 
class  KernelWithLifting_d::Project_along_d_axis_d
 
class  Kernel_d::Side_of_bounded_sphere_d
 
class  Kernel_d::Side_of_oriented_sphere_d
 
class  Kernel_d::Squared_distance_d
 
class  Kernel_d::Value_at_d
 
class  Kernel_d::Vector_to_point_d
 
class  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. More...
 
class  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. More...