|
class | Aff_transformation_2 |
|
class | Aff_transformation_3 |
|
class | Identity_transformation |
|
class | Reflection |
|
class | Rotation |
|
class | Scaling |
|
class | Translation |
|
class | Bbox_2 |
|
class | Bbox_3 |
|
class | Cartesian |
|
class | Cartesian_converter |
|
class | Circle_2 |
|
class | Circle_3 |
|
class | Ambient_dimension |
|
class | Dimension_tag |
|
class | Dynamic_dimension_tag |
|
class | Feature_dimension |
|
class | Direction_2 |
|
class | Direction_3 |
|
class | Exact_predicates_exact_constructions_kernel |
|
class | Exact_predicates_exact_constructions_kernel_with_kth_root |
|
class | Exact_predicates_exact_constructions_kernel_with_root_of |
|
class | Exact_predicates_exact_constructions_kernel_with_sqrt |
|
class | Exact_predicates_inexact_constructions_kernel |
|
class | Filtered_kernel_adaptor |
|
class | Filtered_kernel |
|
class | Filtered_predicate |
|
class | Homogeneous |
|
class | Homogeneous_converter |
|
class | Iso_cuboid_3 |
|
class | Iso_rectangle_2 |
|
class | Kernel_traits |
|
class | Line_2 |
|
class | Line_3 |
|
class | Null_vector |
|
class | Origin |
|
class | Plane_3 |
|
class | Point_2 |
|
class | Point_3 |
|
class | Projection_traits_xy_3 |
|
class | Projection_traits_xz_3 |
|
class | Projection_traits_yz_3 |
|
class | Ray_2 |
|
class | Ray_3 |
|
class | Segment_2 |
|
class | Segment_3 |
|
class | Simple_cartesian |
|
class | Simple_homogeneous |
|
class | Sphere_3 |
|
class | Tetrahedron_3 |
|
class | Triangle_2 |
|
class | Triangle_3 |
|
class | Vector_2 |
|
class | Vector_3 |
|
class | Weighted_point_2 |
|
class | Weighted_point_3 |
|
struct | Construct_array |
|
class | CC_safe_handle |
|
class | Compact_container_base |
|
class | Compact_container |
|
class | Compact_container_traits |
|
class | Compact |
|
class | Fast |
|
class | Concurrent_compact_container_traits |
|
class | Concurrent_compact_container |
|
class | Default |
|
class | Fourtuple |
|
class | Cast_function_object |
|
class | Compare_to_less |
|
class | Creator_1 |
|
class | Creator_2 |
|
class | Creator_3 |
|
class | Creator_4 |
|
class | Creator_5 |
|
class | Creator_uniform_2 |
|
class | Creator_uniform_3 |
|
class | Creator_uniform_4 |
|
class | Creator_uniform_5 |
|
class | Creator_uniform_6 |
|
class | Creator_uniform_7 |
|
class | Creator_uniform_8 |
|
class | Creator_uniform_9 |
|
class | Creator_uniform_d |
|
class | Dereference |
|
class | Get_address |
|
class | Identity |
|
class | Project_facet |
|
class | Project_next |
|
class | Project_next_opposite |
|
class | Project_normal |
|
class | Project_opposite_prev |
|
class | Project_plane |
|
class | Project_point |
|
class | Project_prev |
|
class | Project_vertex |
|
class | In_place_list_base |
|
class | In_place_list |
|
class | Const_oneset_iterator |
|
class | Counting_iterator |
|
class | Dispatch_or_drop_output_iterator |
|
class | Dispatch_output_iterator |
|
class | Emptyset_iterator |
|
class | Filter_iterator |
|
class | Insert_iterator |
|
class | Inverse_index |
|
class | Join_input_iterator_1 |
|
class | Join_input_iterator_2 |
|
class | Join_input_iterator_3 |
|
class | N_step_adaptor |
|
class | Oneset_iterator |
|
class | Random_access_adaptor |
|
class | Random_access_value_adaptor |
|
class | Iterator_range |
|
class | Location_policy |
|
class | Multiset |
|
class | Object |
|
class | Sixtuple |
|
class | Spatial_lock_grid_3 |
|
class | Boolean_tag |
|
struct | Null_functor |
|
struct | Sequential_tag |
|
struct | Parallel_tag |
|
class | Null_tag |
|
class | Threetuple |
|
class | Twotuple |
|
class | Uncertain |
|
class | Quadruple |
|
class | Triple |
|
struct | value_type_traits |
|
struct | value_type_traits< std::back_insert_iterator< Container > > |
|
struct | value_type_traits< std::insert_iterator< Container > > |
|
struct | value_type_traits< std::front_insert_iterator< Container > > |
|
class | Algebraic_structure_traits |
|
class | Euclidean_ring_tag |
|
class | Field_tag |
|
class | Field_with_kth_root_tag |
|
class | Field_with_root_of_tag |
|
class | Field_with_sqrt_tag |
|
class | Integral_domain_tag |
|
class | Integral_domain_without_division_tag |
|
class | Unique_factorization_domain_tag |
|
class | Coercion_traits |
|
class | Fraction_traits |
|
class | Real_embeddable_traits |
|
class | Circulator_from_container |
|
class | Circulator_from_iterator |
|
class | Circulator_traits |
|
class | Container_from_circulator |
|
struct | Circulator_tag |
|
struct | Iterator_tag |
|
struct | Forward_circulator_tag |
|
struct | Bidirectional_circulator_tag |
|
struct | Random_access_circulator_tag |
|
struct | Circulator_base |
|
struct | Forward_circulator_base |
|
struct | Bidirectional_circulator_base |
|
struct | Random_access_circulator_base |
|
class | Forward_circulator_ptrbase |
|
class | Bidirectional_circulator_ptrbase |
|
class | Random_access_circulator_ptrbase |
|
class | Color |
|
class | Input_rep |
|
class | Output_rep |
|
class | Istream_iterator |
|
class | Ostream_iterator |
|
class | Verbose_ostream |
|
class | Approximate_min_ellipsoid_d |
| An object of class Approximate_min_ellipsoid_d is an approximation to the ellipsoid of smallest volume enclosing a finite multiset of points in \( d\)-dimensional Euclidean space \( \E^d\), \( d\ge 2\). More...
|
|
class | Approximate_min_ellipsoid_d_traits_2 |
| The class Approximate_min_ellipsoid_d_traits_2 is a traits class for CGAL::Approximate_min_ellipsoid_d<Traits> using the 2-dimensional CGAL kernel. More...
|
|
class | Approximate_min_ellipsoid_d_traits_3 |
| The class Approximate_min_ellipsoid_d_traits_3 is a traits class for CGAL::Approximate_min_ellipsoid_d<Traits> using the 3-dimensional CGAL kernel. More...
|
|
class | Approximate_min_ellipsoid_d_traits_d |
| The class Approximate_min_ellipsoid_d_traits_d is a traits class for CGAL::Approximate_min_ellipsoid_d<Traits> using the d-dimensional CGAL kernel. More...
|
|
class | Min_annulus_d |
| An object of the class Min_annulus_d is the unique annulus (region between two concentric spheres with radii \( r\) and \( R\), \( r \leq R\)) enclosing a finite set of points in \( d\)-dimensional Euclidean space \( \E^d\), where the difference \( R^2-r^2\) is minimal. More...
|
|
class | Min_circle_2 |
| An object of the class Min_circle_2 is the unique circle of smallest area enclosing a finite (multi)set of points in two-dimensional Euclidean space \( \E^2\). More...
|
|
class | Min_circle_2_traits_2 |
| The class Min_circle_2_traits_2 is a traits class for Min_circle_2<Traits> using the two-dimensional CGAL kernel. More...
|
|
class | Min_ellipse_2 |
| An object of the class Min_ellipse_2 is the unique ellipse of smallest area enclosing a finite (multi)set of points in two-dimensional euclidean space \( \E^2\). More...
|
|
class | Min_ellipse_2_traits_2 |
| The class Min_ellipse_2_traits_2 is a traits class for CGAL::Min_ellipse_2<Traits> using the two-di-men-sional CGAL kernel. More...
|
|
class | Min_quadrilateral_default_traits_2 |
| The class Min_quadrilateral_default_traits_2 is a traits class for the functions min_rectangle_2 , min_parallelogram_2 and min_strip_2 using a two-dimensional CGAL kernel. More...
|
|
class | Min_sphere_annulus_d_traits_2 |
| The class Min_sphere_annulus_d_traits_2 is a traits class for the \( d\)-dimensional optimisation algorithms using the two-dimensional CGAL kernel. More...
|
|
class | Min_sphere_annulus_d_traits_3 |
| The class Min_sphere_annulus_d_traits_3 is a traits class for the \( d\)-dimensional optimisation algorithms using the three-dimensional CGAL kernel. More...
|
|
class | Min_sphere_annulus_d_traits_d |
| The class Min_sphere_annulus_d_traits_d is a traits class for the \( d\)-dimensional optimisation algorithms using the \( d\)-dimensional CGAL kernel. More...
|
|
class | Min_sphere_d |
| An object of the class Min_sphere_d is the unique sphere of smallest volume enclosing a finite (multi)set of points in \( d\)-dimensional Euclidean space \( \E^d\). More...
|
|
class | Min_sphere_of_points_d_traits_2 |
| The class Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits . More...
|
|
class | Min_sphere_of_points_d_traits_3 |
| The class Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits . More...
|
|
class | Min_sphere_of_points_d_traits_d |
| The class Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits . More...
|
|
class | Min_sphere_of_spheres_d |
| An object of the class Min_sphere_of_spheres_d is a data structure that represents the unique sphere of smallest volume enclosing a finite set of spheres in \( d\)-dimensional Euclidean space \( \E^d\). More...
|
|
class | Min_sphere_of_spheres_d_traits_2 |
| The class Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits . More...
|
|
class | Min_sphere_of_spheres_d_traits_3 |
| The class Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits . More...
|
|
class | Min_sphere_of_spheres_d_traits_d |
| The class Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm> is a model for concept MinSphereOfSpheresTraits . More...
|
|
class | Rectangular_p_center_default_traits_2 |
| The class Rectangular_p_center_default_traits_2 defines types and operations needed to compute rectilinear \( p\)-centers of a planar point set using the function rectangular_p_center_2() . More...
|
|
|
template<class ForwardIterator , class OutputIterator , class Traits > |
OutputIterator | min_parallelogram_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits) |
| The function computes a minimum area enclosing parallelogram \( A(P)\) of a given convex point set \( P\). More...
|
|
template<class ForwardIterator , class OutputIterator , class Traits > |
OutputIterator | min_rectangle_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits) |
| The function computes a minimum area enclosing rectangle \( R(P)\) of a given convex point set \( P\). More...
|
|
template<class ForwardIterator , class OutputIterator , class Traits > |
OutputIterator | min_strip_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits) |
| The function computes a minimum width enclosing strip \( S(P)\) of a given convex point set \( P\). More...
|
|
template<class ForwardIterator , class OutputIterator , class FT , class Traits > |
OutputIterator | rectangular_p_center_2 (ForwardIterator f, ForwardIterator l, OutputIterator o, FT &r, int p, const Traits &t=Default_traits) |
| Computes rectilinear \( p\)-centers of a planar point set, i.e. a set of \( p\) points such that the maximum minimal \( L_{\infty}\)-distance between both sets is minimized. More...
|
|