|
CGAL 5.1 - 2D and 3D Linear Geometry Kernel
|
Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable Hashable Hashable Kernel Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Kernel::Circle_3 Kernel::Direction_2 Kernel::Direction_3 Kernel Kernel Kernel Kernel Kernel Kernel Kernel Kernel Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Kernel::Line_2 Kernel::Line_3 Kernel::Plane_3 Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
The class is a model of several 2D triangulation traits class concepts, except that it does not provide the type and constructors required to build the dual Voronoi diagram.
Kernel::Ray_2 Kernel::Ray_3 Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Kernel Kernel Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Kernel::Tetrahedron_3 Kernel::Triangle_2 Kernel::Triangle_3 Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable
Hashable if Kernel is a cartesian kernel and if Kernel::FT is Hashable