CGAL 5.4.3 - Geometric Object Generators
CGAL Namespace Reference

Namespaces

 cpp11
 
 cpp98
 
 IO
 
 Mesh_2
 
 Mesh_3
 
 parameters
 

Classes

class  Aff_transformation_2
 
class  Aff_transformation_3
 
class  Algebraic_structure_traits
 
struct  Ambient_dimension
 
class  Bbox_2
 
class  Bbox_3
 
struct  Bidirectional_circulator_base
 
class  Bidirectional_circulator_ptrbase
 
struct  Bidirectional_circulator_tag
 
struct  Boolean_tag
 
struct  Cartesian
 
class  Cartesian_converter
 
struct  Cast_function_object
 
class  CC_safe_handle
 
class  Circle_2
 
class  Circle_3
 
struct  Circulator_base
 
class  Circulator_from_container
 
class  Circulator_from_iterator
 
struct  Circulator_tag
 
struct  Circulator_traits
 
struct  Coercion_traits
 
class  Combination_enumerator
 The class Combination_enumerator is used to enumerate all fixed-size combinations (subsets) of a source range of elements. More...
 
struct  Compact
 
class  Compact_container
 
class  Compact_container_base
 
struct  Compact_container_traits
 
class  Compact_mesh_cell_base_3
 
class  Compare_to_less
 
class  Concurrent_compact_container
 
struct  Concurrent_compact_container_traits
 
class  Const_oneset_iterator
 
class  Constrained_Delaunay_triangulation_2
 
class  Constrained_triangulation_2
 
class  Constrained_triangulation_face_base_2
 
class  Constrained_triangulation_plus_2
 
struct  Construct_array
 
class  Container_from_circulator
 
class  Counting_iterator
 
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
 
struct  Default
 
class  Delaunay_mesh_criteria_2
 
class  Delaunay_mesh_face_base_2
 
class  Delaunay_mesh_size_criteria_2
 
class  Delaunay_mesh_vertex_base_2
 
class  Delaunay_mesher_2
 
class  Delaunay_triangulation_2
 
struct  Dereference
 
struct  Dimension_tag
 
class  Direction_2
 
class  Direction_3
 
class  Dispatch_or_drop_output_iterator
 
class  Dispatch_output_iterator
 
class  Dual
 
struct  Dynamic_dimension_tag
 
struct  dynamic_edge_property_t
 
struct  dynamic_face_property_t
 
struct  dynamic_halfedge_property_t
 
struct  dynamic_vertex_property_t
 
struct  Emptyset_iterator
 
struct  Euclidean_ring_tag
 
struct  Exact_intersections_tag
 
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
 
struct  Exact_predicates_tag
 
class  Face_around_face_circulator
 
class  Face_around_face_iterator
 
class  Face_around_target_circulator
 
class  Face_around_target_iterator
 
struct  Face_filtered_graph
 
struct  Fast
 
struct  Feature_dimension
 
struct  Field_tag
 
struct  Field_with_kth_root_tag
 
struct  Field_with_root_of_tag
 
struct  Field_with_sqrt_tag
 
struct  Filter_iterator
 
struct  Filtered_kernel
 
struct  Filtered_kernel_adaptor
 
class  Filtered_predicate
 
struct  Forward_circulator_base
 
class  Forward_circulator_ptrbase
 
struct  Forward_circulator_tag
 
class  Fourtuple
 
class  Fraction_traits
 
struct  Get_address
 
struct  graph_has_property
 
struct  Graph_with_descriptor_with_graph
 
struct  Graph_with_descriptor_with_graph_property_map
 
class  Gray_image_mesh_domain_3
 
class  Halfedge_around_face_circulator
 
class  Halfedge_around_face_iterator
 
class  Halfedge_around_source_circulator
 
class  Halfedge_around_source_iterator
 
class  Halfedge_around_target_circulator
 
class  Halfedge_around_target_iterator
 
class  HalfedgeDS_face_max_base_with_id
 
class  HalfedgeDS_halfedge_max_base_with_id
 
class  HalfedgeDS_vertex_max_base_with_id
 
struct  Homogeneous
 
class  Homogeneous_converter
 
struct  Identity
 
class  Identity_transformation
 
class  Image_3
 
class  Implicit_mesh_domain_3
 
class  Implicit_multi_domain_to_labeling_function_wrapper
 
class  In_place_list
 
class  In_place_list_base
 
class  Input_rep
 
class  Insert_iterator
 
struct  Integral_domain_tag
 
struct  Integral_domain_without_division_tag
 
class  Inverse_index
 
class  Iso_cuboid_3
 
class  Iso_rectangle_2
 
class  Istream_iterator
 
class  Iterator_range
 
struct  Iterator_tag
 
class  Join_input_iterator_1
 
class  Join_input_iterator_2
 
class  Join_input_iterator_3
 
struct  Kernel_traits
 
class  Labeled_image_mesh_domain_3
 
class  Labeled_mesh_domain_3
 
class  Line_2
 
class  Line_3
 
struct  Linear_cell_complex_bgl_min_items
 
struct  Linear_cell_complex_for_bgl_combinatorial_map_helper
 
struct  Location_policy
 
class  Mesh_cell_base_3
 
class  Mesh_cell_criteria_3
 
class  Mesh_complex_3_in_triangulation_3
 
class  Mesh_constant_domain_field_3
 
class  Mesh_criteria_3
 
class  Mesh_domain_with_polyline_features_3
 
class  Mesh_edge_criteria_3
 
class  Mesh_facet_criteria_3
 
struct  Mesh_polyhedron_3
 
struct  Mesh_triangulation_3
 
class  Mesh_vertex_base_3
 
class  Multiset
 
class  N_step_adaptor
 
struct  No_constraint_intersection_requiring_constructions_tag
 
struct  No_constraint_intersection_tag
 
struct  No_intersection_tag
 
struct  Null_functor
 
struct  Null_tag
 
class  Null_vector
 
class  Object
 
class  Oneset_iterator
 
class  Origin
 
class  Ostream_iterator
 
class  Output_rep
 
struct  Parallel_if_available_tag
 
struct  Parallel_tag
 
class  Plane_3
 
class  Point_2
 
class  Point_3
 
class  Points_on_segment_2
 The class Points_on_segment_2 is a generator for points on a segment whose endpoints are specified upon construction. More...
 
class  Polyhedral_complex_mesh_domain_3
 
class  Polyhedral_mesh_domain_3
 
class  Polyhedral_mesh_domain_with_features_3
 
class  Polyhedron_items_with_id_3
 
struct  Project_facet
 
struct  Project_next
 
struct  Project_next_opposite
 
struct  Project_normal
 
struct  Project_opposite_prev
 
struct  Project_plane
 
struct  Project_point
 
struct  Project_prev
 
struct  Project_vertex
 
class  Projection_traits_3
 
class  Projection_traits_xy_3
 
class  Projection_traits_xz_3
 
class  Projection_traits_yz_3
 
class  Quadruple
 
class  Random
 The class Random is a random numbers generator. More...
 
class  Random_access_adaptor
 
struct  Random_access_circulator_base
 
class  Random_access_circulator_ptrbase
 
struct  Random_access_circulator_tag
 
class  Random_access_value_adaptor
 
struct  Random_convex_set_traits_2
 The class Random_convex_set_traits_2 serves as a traits class for the function random_convex_set_2(). More...
 
class  Random_points_in_ball_d
 The class Random_points_in_ball_d is an input iterator creating points uniformly distributed in an open ball in any dimension. More...
 
class  Random_points_in_cube_3
 The class Random_points_in_cube_3 is an input iterator creating points uniformly distributed in a half-open cube. More...
 
class  Random_points_in_cube_d
 The class Random_points_in_cube_d is an input iterator creating points uniformly distributed in an half-open cube. More...
 
class  Random_points_in_disc_2
 The class Random_points_in_disc_2 is an input iterator creating points uniformly distributed in an open disc. More...
 
class  Random_points_in_sphere_3
 The class Random_points_in_sphere_3 is an input iterator creating points uniformly distributed strictly inside a sphere. More...
 
class  Random_points_in_square_2
 The class Random_points_in_square_2 is an input iterator creating points uniformly distributed in a half-open square. More...
 
class  Random_points_in_tetrahedral_mesh_3
 The class Random_points_in_tetrahedral_mesh_3 is an input iterator creating points uniformly distributed inside a tetrahedral mesh of type Mesh_complex_3_in_triangulation_3. More...
 
class  Random_points_in_tetrahedral_mesh_boundary_3
 The class Random_points_in_tetrahedral_mesh_boundary_3 is an input iterator creating points uniformly distributed on the boundary of a tetrahedral mesh of type Mesh_complex_3_in_triangulation_3. More...
 
class  Random_points_in_tetrahedron_3
 The class Random_points_in_tetrahedron_3 is an input iterator creating points uniformly distributed inside a tetrahedron. More...
 
class  Random_points_in_triangle_2
 The class Random_points_in_triangle_2 is an input iterator creating points uniformly distributed inside a triangle. More...
 
class  Random_points_in_triangle_3
 The class Random_points_in_triangle_3 is an input iterator creating points uniformly distributed inside a 3D triangle. More...
 
class  Random_points_in_triangle_mesh_2
 The class Random_points_in_triangle_mesh_2 is an input iterator creating points uniformly distributed inside a 2D domain represented by a 2D triangulation. More...
 
struct  Random_points_in_triangle_mesh_3
 The class Random_points_in_triangle_mesh_3 is an input iterator creating points uniformly distributed inside the faces of a triangle mesh model of FaceListGraph. More...
 
struct  Random_points_in_triangles_2
 The class Random_points_in_triangles_2 is an input iterator creating points uniformly distributed inside a range of Triangle_2. More...
 
struct  Random_points_in_triangles_3
 The class Random_points_in_triangles_3 is an input iterator creating points uniformly distributed inside a range of Triangle_3. More...
 
class  Random_points_on_circle_2
 The class Random_points_on_circle_2 is an input iterator creating points uniformly distributed on a circle. More...
 
class  Random_points_on_segment_2
 The class Random_points_on_segment_2 is an input iterator creating points uniformly distributed on a segment. More...
 
class  Random_points_on_segment_3
 The class Random_points_on_segment_3 is an input iterator creating points uniformly distributed on a segment. More...
 
class  Random_points_on_sphere_3
 The class Random_points_on_sphere_3 is an input iterator creating points uniformly distributed on a sphere. More...
 
class  Random_points_on_sphere_d
 The class Random_points_on_sphere_d is an input iterator creating points uniformly distributed on a sphere. More...
 
class  Random_points_on_square_2
 The class Random_points_on_square_2 is an input iterator creating points uniformly distributed on the boundary of a square. More...
 
class  Ray_2
 
class  Ray_3
 
class  Real_embeddable_traits
 
class  Reflection
 
class  Regular_triangulation_2
 
class  Regular_triangulation_face_base_2
 
class  Regular_triangulation_vertex_base_2
 
class  Rotation
 
class  Scaling
 
class  Seam_mesh
 
class  Segment_2
 
class  Segment_3
 
struct  Sequential_tag
 
struct  Simple_cartesian
 
struct  Simple_homogeneous
 
class  Sixtuple
 
class  Spatial_lock_grid_3
 
class  Sphere_3
 
class  Tetrahedron_3
 
class  Threetuple
 
class  Translation
 
class  Triangle_2
 
class  Triangle_3
 
class  Triangle_accessor_3
 
class  Triangulation_2
 
class  Triangulation_conformer_2
 
class  Triangulation_cw_ccw_2
 
class  Triangulation_face_base_2
 
class  Triangulation_face_base_with_id_2
 
class  Triangulation_face_base_with_info_2
 
class  Triangulation_hierarchy_2
 
class  Triangulation_hierarchy_vertex_base_2
 
class  Triangulation_vertex_base_2
 
class  Triangulation_vertex_base_with_id_2
 
class  Triangulation_vertex_base_with_info_2
 
class  Triple
 
class  Twotuple
 
class  Uncertain
 
struct  Unique_factorization_domain_tag
 
struct  value_type_traits
 
struct  value_type_traits< std::back_insert_iterator< Container > >
 
struct  value_type_traits< std::front_insert_iterator< Container > >
 
struct  value_type_traits< std::insert_iterator< Container > >
 
class  Vector_2
 
class  Vector_3
 
class  Verbose_ostream
 
class  Vertex_around_face_iterator
 
class  Vertex_around_target_circulator
 
class  Vertex_around_target_iterator
 
class  Weighted_point_2
 
class  Weighted_point_3
 

Typedefs

typedef Sign Orientation
 
typedef Location_policy< CompactCompact_location
 
typedef Location_policy< FastFast_location
 
typedef CGAL::Boolean_tag< false > Tag_false
 
typedef CGAL::Boolean_tag< true > Tag_true
 
typedef void(* Failure_function) (const char *type, const char *expression, const char *file, int line, const char *explanation)
 

Enumerations

enum  Mesh_optimization_return_code
 
enum  Mesh_facet_topology
 
enum  Angle
 
enum  Bounded_side
 
enum  Comparison_result
 
enum  Sign
 
enum  Oriented_side
 
enum  Box_parameter_space_2
 
enum  Failure_behaviour
 
enum  vertex_index_t
 
enum  halfedge_index_t
 
enum  edge_index_t
 
enum  face_index_t
 
enum  vertex_point_t
 

Functions

std::string data_file_path (const std::string &filename)
 
void refine_Delaunay_mesh_2 (CDT &t, const Criteria &criteria=Criteria())
 
void refine_Delaunay_mesh_2 (CDT &t, InputIterator begin, InputIterator end, const Criteria &criteria=Criteria(), bool mark=false)
 
CGAL::Mesh_optimization_return_code lloyd_optimize_mesh_2 (CDT &cdt, double parameters::time_limit=0, std::size_t parameters::max_iteration_number=0, double parameters::convergence=0.001, double parameters::freeze_bound=0.001, PointIterator parameters::seeds_begin=PointIterator(), PointIterator parameters::seeds_end=PointIterator(), bool parameters::mark=false)
 
void make_conforming_Delaunay_2 (CDT &t)
 
void make_conforming_Gabriel_2 (CDT &t)
 
Mesh_optimization_return_code exude_mesh_3 (C3T3 &c3t3, double parameters::time_limit=0, double parameters::sliver_bound=0)
 
void facets_in_complex_3_to_triangle_mesh (const C3T3 &c3t3, TriangleMesh &graph)
 
Mesh_optimization_return_code lloyd_optimize_mesh_3 (C3T3 &c3t3, const MD &domain, double parameters::time_limit=0, std::size_t parameters::max_iteration_number=0, double parameters::convergence=0.02, double parameters::freeze_bound=0.01, bool parameters::do_freeze=true)
 
C3T3 make_mesh_3 (const MD &domain, const MC &criteria, parameters::internal::Features_options features=parameters::features(domain), parameters::internal::Lloyd_options lloyd=parameters::no_lloyd(), parameters::internal::Odt_options odt=parameters::no_odt(), parameters::internal::Perturb_options perturb=parameters::perturb(), parameters::internal::Exude_options exude=parameters::exude(), parameters::internal::Manifold_options manifold=parameters::non_manifold())
 
Mesh_optimization_return_code odt_optimize_mesh_3 (C3T3 &c3t3, const MD &domain, double parameters::time_limit=0, std::size_t parameters::max_iteration_number=0, double parameters::convergence=0.02, double parameters::freeze_bound=0.01, bool parameters::do_freeze=true)
 
Mesh_optimization_return_code perturb_mesh_3 (C3T3 &c3t3, const MD &domain, double parameters::time_limit=0, double parameters::sliver_bound=0)
 
void refine_mesh_3 (C3T3 &c3t3, const MD &mesh_domain, const MC &mesh_criteria, parameters::internal::Lloyd_options lloyd=parameters::no_lloyd(), parameters::internal::Odt_options odt=parameters::no_odt(), parameters::internal::Perturb_options perturb=parameters::perturb(), parameters::internal::Exude_options exude=parameters::exude(), parameters::internal::Manifold_options manifold=parameters::non_manifold())
 
void draw (const T2 &at2)
 
enum_cast (const U &u)
 
Oriented_side opposite (const Oriented_side &o)
 
Bounded_side opposite (const Bounded_side &o)
 
bool do_intersect (Type1< Kernel > obj1, Type2< Kernel > obj2)
 
bool do_intersect (Plane_3< Kernel > obj1, Plane_3< Kernel > obj2, Plane_3< Kernel > obj3)
 
decltype(auto) intersection (Type1< Kernel > obj1, Type2< Kernel > obj2)
 
decltype(auto) intersection (const Plane_3< Kernel > &pl1, const Plane_3< Kernel > &pl2, const Plane_3< Kernel > &pl3)
 
Angle angle (const CGAL::Vector_2< Kernel > &u, const CGAL::Vector_2< Kernel > &v)
 
Angle angle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
Angle angle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s)
 
Angle angle (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v)
 
Angle angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
Angle angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
Angle angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Vector_3< Kernel > &v)
 
Kernel::FT approximate_angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
Kernel::FT approximate_angle (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v)
 
Kernel::FT approximate_dihedral_angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
Kernel::FT area (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
bool are_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
bool are_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
bool are_strictly_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
bool are_strictly_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
CGAL::Point_2< Kernelbarycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2)
 
CGAL::Point_2< Kernelbarycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2)
 
CGAL::Point_2< Kernelbarycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_2< Kernel > &p3)
 
CGAL::Point_2< Kernelbarycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_2< Kernel > &p3, const Kernel::FT &w3)
 
CGAL::Point_2< Kernelbarycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_2< Kernel > &p3, const Kernel::FT &w3, const CGAL::Point_2< Kernel > &p4)
 
CGAL::Point_2< Kernelbarycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_2< Kernel > &p3, const Kernel::FT &w3, const CGAL::Point_2< Kernel > &p4, const Kernel::FT &w4)
 
CGAL::Point_3< Kernelbarycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2)
 
CGAL::Point_3< Kernelbarycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2)
 
CGAL::Point_3< Kernelbarycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_3< Kernel > &p3)
 
CGAL::Point_3< Kernelbarycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_3< Kernel > &p3, const Kernel::FT &w3)
 
CGAL::Point_3< Kernelbarycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_3< Kernel > &p3, const Kernel::FT &w3, const CGAL::Point_3< Kernel > &p4)
 
CGAL::Point_3< Kernelbarycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_3< Kernel > &p3, const Kernel::FT &w3, const CGAL::Point_3< Kernel > &p4, const Kernel::FT &w4)
 
CGAL::Line_2< Kernelbisector (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
CGAL::Line_2< Kernelbisector (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2)
 
CGAL::Plane_3< Kernelbisector (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
CGAL::Plane_3< Kernelbisector (const CGAL::Plane_3< Kernel > &h1, const CGAL::Plane_3< Kernel > &h2)
 
CGAL::Point_2< Kernelcentroid (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
CGAL::Point_2< Kernelcentroid (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s)
 
CGAL::Point_2< Kernelcentroid (const CGAL::Triangle_2< Kernel > &t)
 
CGAL::Point_3< Kernelcentroid (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
CGAL::Point_3< Kernelcentroid (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
CGAL::Point_3< Kernelcentroid (const CGAL::Triangle_3< Kernel > &t)
 
CGAL::Point_3< Kernelcentroid (const CGAL::Tetrahedron_3< Kernel > &t)
 
CGAL::Point_2< Kernelcircumcenter (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
CGAL::Point_2< Kernelcircumcenter (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
CGAL::Point_2< Kernelcircumcenter (const CGAL::Triangle_2< Kernel > &t)
 
CGAL::Point_3< Kernelcircumcenter (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
CGAL::Point_3< Kernelcircumcenter (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
CGAL::Point_3< Kernelcircumcenter (const CGAL::Triangle_3< Kernel > &t)
 
CGAL::Point_3< Kernelcircumcenter (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
CGAL::Point_3< Kernelcircumcenter (const CGAL::Tetrahedron_3< Kernel > &t)
 
bool collinear_are_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
bool collinear_are_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
bool collinear_are_strictly_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
bool collinear_are_strictly_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
bool collinear (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
bool collinear (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
Comparison_result compare_dihedral_angle (const CGAL::Point_3< Kernel > &a1, const CGAL::Point_3< Kernel > &b1, const CGAL::Point_3< Kernel > &c1, const CGAL::Point_3< Kernel > &d1, const Kernel::FT &cosine)
 
Comparison_result compare_dihedral_angle (const CGAL::Point_3< Kernel > &a1, const CGAL::Point_3< Kernel > &b1, const CGAL::Point_3< Kernel > &c1, const CGAL::Point_3< Kernel > &d1, const CGAL::Point_3< Kernel > &a2, const CGAL::Point_3< Kernel > &b2, const CGAL::Point_3< Kernel > &c2, const CGAL::Point_3< Kernel > &d2)
 
Comparison_result compare_dihedral_angle (const CGAL::Vector_3< Kernel > &u1, const CGAL::Vector_3< Kernel > &v1, const CGAL::Vector_3< Kernel > &w1, const Kernel::FT &cosine)
 
Comparison_result compare_dihedral_angle (const CGAL::Vector_3< Kernel > &u1, const CGAL::Vector_3< Kernel > &v1, const CGAL::Vector_3< Kernel > &w1, const CGAL::Vector_3< Kernel > &u2, const CGAL::Vector_3< Kernel > &v2, const CGAL::Vector_3< Kernel > &w2)
 
Comparison_result compare_distance_to_point (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
Comparison_result compare_distance_to_point (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
Comparison_result compare_lexicographically (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
Comparison_result compare_lexicographically (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
Comparison_result compare_signed_distance_to_line (const CGAL::Line_2< Kernel > &l, const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
Comparison_result compare_signed_distance_to_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s)
 
Comparison_result compare_signed_distance_to_plane (const CGAL::Plane_3< Kernel > &h, const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
Comparison_result compare_signed_distance_to_plane (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &t)
 
Comparison_result compare_slope (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2)
 
Comparison_result compare_slope (const CGAL::Segment_2< Kernel > &s1, const CGAL::Segment_2< Kernel > &s2)
 
Comparison_result compare_slope (const CGAL::Point_2< Kernel > &s1s, const CGAL::Point_2< Kernel > &s1t, const CGAL::Point_2< Kernel > &s2s, const CGAL::Point_2< Kernel > &s2t)
 
Comparison_result compare_slope (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
Comparison_result compare_squared_distance (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const typename Kernel::FT &d2)
 
Comparison_result compare_squared_distance (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const typename Kernel::FT &d2)
 
Comparison_result compare_squared_radius (const CGAL::Point_3< Kernel > &p, const typename Kernel::FT &sr)
 
Comparison_result compare_squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const typename Kernel::FT &sr)
 
Comparison_result compare_squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const typename Kernel::FT &sr)
 
Comparison_result compare_squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const typename Kernel::FT &sr)
 
Comparison_result compare_x (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
Comparison_result compare_x (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
Comparison_result compare_x (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2)
 
Comparison_result compare_x (const CGAL::Line_2< Kernel > &l, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
 
Comparison_result compare_x (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
 
Comparison_result compare_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_point_2< CircularKernel > &q)
 
Comparison_result compare_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Point_2< CircularKernel > &q)
 
Comparison_result compare_x (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
 
Comparison_result compare_x (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
 
Comparison_result compare_xy (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
Comparison_result compare_xy (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
Comparison_result compare_xy (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_point_2< CircularKernel > &q)
 
Comparison_result compare_xy (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Point_2< CircularKernel > &q)
 
Comparison_result compare_xy (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
 
Comparison_result compare_xy (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
 
Comparison_result compare_x_at_y (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h)
 
Comparison_result compare_x_at_y (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
 
Comparison_result compare_x_at_y (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h)
 
Comparison_result compare_x_at_y (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
 
Comparison_result compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h)
 
Comparison_result compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
 
Comparison_result compare_y_at_x (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h)
 
Comparison_result compare_y_at_x (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
 
Comparison_result compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Segment_2< Kernel > &s)
 
Comparison_result compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Segment_2< Kernel > &s1, const CGAL::Segment_2< Kernel > &s2)
 
Comparison_result compare_y (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
Comparison_result compare_y (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
Comparison_result compare_y (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2)
 
Comparison_result compare_y (const CGAL::Line_2< Kernel > &l, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
 
Comparison_result compare_y (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
 
Comparison_result compare_y (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_point_2< CircularKernel > &q)
 
Comparison_result compare_y (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Point_2< CircularKernel > &q)
 
Comparison_result compare_y (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
 
Comparison_result compare_y (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
 
Comparison_result compare_xyz (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
Comparison_result compare_xyz (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
 
Comparison_result compare_xyz (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
 
Comparison_result compare_z (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
Comparison_result compare_z (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
 
Comparison_result compare_z (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
 
Comparison_result compare_yx (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
bool coplanar (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
Orientation coplanar_orientation (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
Orientation coplanar_orientation (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
Bounded_side coplanar_side_of_bounded_circle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
CGAL::Vector_3< Kernelcross_product (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v)
 
Kernel::FT determinant (const CGAL::Vector_2< Kernel > &v, const CGAL::Vector_2< Kernel > &w)
 
Kernel::FT determinant (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v, const CGAL::Vector_3< Kernel > &w)
 
CGAL::Line_3< Kernelequidistant_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
bool has_larger_distance_to_point (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
bool has_larger_distance_to_point (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
bool has_larger_signed_distance_to_line (const CGAL::Line_2< Kernel > &l, const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
bool has_larger_signed_distance_to_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s)
 
bool has_larger_signed_distance_to_plane (const CGAL::Plane_3< Kernel > &h, const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
bool has_larger_signed_distance_to_plane (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &t)
 
bool has_smaller_distance_to_point (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
bool has_smaller_distance_to_point (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
bool has_smaller_signed_distance_to_line (const CGAL::Line_2< Kernel > &l, const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
bool has_smaller_signed_distance_to_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s)
 
bool has_smaller_signed_distance_to_plane (const CGAL::Plane_3< Kernel > &h, const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
bool has_smaller_signed_distance_to_plane (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &t)
 
Kernel::FT l_infinity_distance (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
Kernel::FT l_infinity_distance (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
bool left_turn (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
bool lexicographically_xy_larger (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
bool lexicographically_xy_larger_or_equal (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
bool lexicographically_xy_smaller (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
bool lexicographically_xy_smaller_or_equal (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
bool lexicographically_xyz_smaller (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
bool lexicographically_xyz_smaller_or_equal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
CGAL::Point_2< Kernelmax_vertex (const CGAL::Iso_rectangle_2< Kernel > &ir)
 
CGAL::Point_3< Kernelmax_vertex (const CGAL::Iso_cuboid_3< Kernel > &ic)
 
CGAL::Point_2< Kernelmidpoint (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
CGAL::Point_2< Kernelmidpoint (const CGAL::Segment_2< Kernel > &s)
 
CGAL::Point_3< Kernelmidpoint (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
CGAL::Point_3< Kernelmidpoint (const CGAL::Segment_3< Kernel > &s)
 
CGAL::Point_2< Kernelmin_vertex (const CGAL::Iso_rectangle_2< Kernel > &ir)
 
CGAL::Point_3< Kernelmin_vertex (const CGAL::Iso_cuboid_3< Kernel > &ic)
 
CGAL::Vector_3< Kernelnormal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
Orientation orientation (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
Orientation orientation (const CGAL::Vector_2< Kernel > &u, const CGAL::Vector_2< Kernel > &v)
 
Orientation orientation (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
Orientation orientation (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v, const CGAL::Vector_3< Kernel > &w)
 
CGAL::Vector_3< Kernelorthogonal_vector (const CGAL::Plane_3< Kernel > &p)
 
CGAL::Vector_3< Kernelorthogonal_vector (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
bool parallel (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2)
 
bool parallel (const CGAL::Ray_2< Kernel > &r1, const CGAL::Ray_2< Kernel > &r2)
 
bool parallel (const CGAL::Segment_2< Kernel > &s1, const CGAL::Segment_2< Kernel > &s2)
 
bool parallel (const CGAL::Line_3< Kernel > &l1, const CGAL::Line_3< Kernel > &l2)
 
bool parallel (const CGAL::Plane_3< Kernel > &h1, const CGAL::Plane_3< Kernel > &h2)
 
bool parallel (const CGAL::Ray_3< Kernel > &r1, const CGAL::Ray_3< Kernel > &r2)
 
bool parallel (const CGAL::Segment_3< Kernel > &s1, const CGAL::Segment_3< Kernel > &s2)
 
CGAL::Plane_3< Kernelradical_plane (const CGAL::Sphere_3< Kernel > &s1, const CGAL::Sphere_3< Kernel > &s2)
 
CGAL::Line_2< Kernelradical_line (const CGAL::Circle_2< Kernel > &c1, const CGAL::Circle_2< Kernel > &c2)
 
bool right_turn (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
Kernel::FT scalar_product (const CGAL::Vector_2< Kernel > &u, const CGAL::Vector_2< Kernel > &v)
 
Kernel::FT scalar_product (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v)
 
Bounded_side side_of_bounded_circle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &t)
 
Bounded_side side_of_bounded_circle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &t)
 
Bounded_side side_of_bounded_sphere (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &t)
 
Bounded_side side_of_bounded_sphere (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &t)
 
Bounded_side side_of_bounded_sphere (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &t)
 
Oriented_side side_of_oriented_circle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &test)
 
Oriented_side side_of_oriented_sphere (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &test)
 
Kernel::FT squared_area (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
FT squared_radius (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
 
FT squared_radius (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
FT squared_radius (const CGAL::Point_2< Kernel > &p)
 
FT squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
 
FT squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
FT squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
FT squared_radius (const CGAL::Point_3< Kernel > &p)
 
CGAL::Vector_3< Kernelunit_normal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
 
Kernel::FT volume (const CGAL::Point_3< Kernel > &p0, const CGAL::Point_3< Kernel > &p1, const CGAL::Point_3< Kernel > &p2, const CGAL::Point_3< Kernel > &p3)
 
bool x_equal (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
bool x_equal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
bool y_equal (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 
bool y_equal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
bool z_equal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
 
void rational_rotation_approximation (const RingNumberType &dirx, const RingNumberType &diry, RingNumberType &sin_num, RingNumberType &cos_num, RingNumberType &denom, const RingNumberType &eps_num, const RingNumberType &eps_den)
 
Kernel::FT squared_distance (Type1< Kernel > obj1, Type2< Kernel > obj2)
 
Point_2< Homogeneous< RT > > cartesian_to_homogeneous (const Point_2< Cartesian< RT > > &cp)
 
Point_3< Homogeneous< RT > > cartesian_to_homogeneous (const Point_3< Cartesian< RT > > &cp)
 
Point_2< Cartesian< FT > > homogeneous_to_cartesian (const Point_2< Homogeneous< FT > > &hp)
 
Point_3< Cartesian< FT > > homogeneous_to_cartesian (const Point_3< Homogeneous< FT > > &hp)
 
Point_2< Cartesian< Quotient< RT > > > homogeneous_to_quotient_cartesian (const Point_2< Homogeneous< RT > > &hp)
 
Point_3< Cartesian< Quotient< RT > > > homogeneous_to_quotient_cartesian (const Point_3< Homogeneous< RT > > &hp)
 
Point_2< Homogeneous< RT > > quotient_cartesian_to_homogeneous (const Point_2< Cartesian< Quotient< RT > > > &cp)
 
Point_3< Homogeneous< RT > > quotient_cartesian_to_homogeneous (const Point_3< Cartesian< Quotient< RT > > > &cp)
 
bool do_intersect (Type1< CircularKernel > obj1, Type2< CircularKernel > obj2)
 
OutputIterator intersection (const Type1 &obj1, const Type2 &obj2, OutputIterator intersections)
 
Comparison_result compare_y_at_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_2< CircularKernel > &a)
 
Comparison_result compare_y_at_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Line_arc_2< CircularKernel > &a)
 
bool do_intersect (Type1< SphericalKernel > obj1, Type2< SphericalKernel > obj2)
 
bool do_intersect (Type1< SphericalKernel > obj1, Type2< SphericalKernel > obj2, Type3< SphericalKernel > obj3)
 
OutputIterator intersection (const SphericalType1 &obj1, const SphericalType2 &obj2, OutputIterator intersections)
 
OutputIterator intersection (const Type1 &obj1, const Type2 &obj2, const Type3 &obj3, OutputIterator intersections)
 
OutputIterator copy_n (InputIterator first, Size n, OutputIterator result)
 
std::pair< ForwardIterator, ForwardIteratormin_max_element (ForwardIterator first, ForwardIterator last)
 
std::pair< ForwardIterator, ForwardIteratormin_max_element (ForwardIterator first, ForwardIterator last, CompareMin comp_min, CompareMax comp_max)
 
BidirectionalIterator predecessor (BidirectionalIterator it)
 
ForwardIterator successor (ForwardIterator it)
 
std::array< T, N > make_array (const T &...)
 
CC_safe_handle< CC_iterator > make_cc_safe_handle (CC_iterator iterator)
 
Compare_to_less< F > compare_to_less (const F &f)
 
Iterator_range< T > make_range (const T &b, const T &e)
 
range_begin (Iterator_range< T > &x)
 
range_end (Iterator_range< T > &x)
 
range_begin (const Iterator_range< T > &x)
 
range_end (const Iterator_range< T > &x)
 
Failure_function set_error_handler (Failure_function handler)
 
Failure_function set_warning_handler (Failure_function handler)
 
Failure_behaviour set_error_behaviour (Failure_behaviour eb)
 
Failure_behaviour set_warning_behaviour (Failure_behaviour eb)
 
NT abs (const NT &x)
 
result_type compare (const NT &x, const NT &y)
 
result_type div (const NT1 &x, const NT2 &y)
 
void div_mod (const NT1 &x, const NT2 &y, result_type &q, result_type &r)
 
result_type gcd (const NT1 &x, const NT2 &y)
 
result_type integral_division (const NT1 &x, const NT2 &y)
 
NT inverse (const NT &x)
 
result_type is_negative (const NT &x)
 
result_type is_one (const NT &x)
 
result_type is_positive (const NT &x)
 
result_type is_square (const NT &x)
 
result_type is_square (const NT &x, NT &y)
 
result_type is_zero (const NT &x)
 
NT kth_root (int k, const NT &x)
 
result_type mod (const NT1 &x, const NT2 &y)
 
NT root_of (int k, InputIterator begin, InputIterator end)
 
result_type sign (const NT &x)
 
void simplify (const NT &x)
 
NT sqrt (const NT &x)
 
NT square (const NT &x)
 
double to_double (const NT &x)
 
std::pair< double, double > to_interval (const NT &x)
 
NT unit_part (const NT &x)
 
void Assert_circulator (const C &c)
 
void Assert_iterator (const I &i)
 
void Assert_circulator_or_iterator (const IC &i)
 
void Assert_input_category (const I &i)
 
void Assert_output_category (const I &i)
 
void Assert_forward_category (const IC &ic)
 
void Assert_bidirectional_category (const IC &ic)
 
void Assert_random_access_category (const IC &ic)
 
C::difference_type circulator_distance (C c, C d)
 
C::size_type circulator_size (C c)
 
bool is_empty_range (const IC &i, const IC &j)
 
iterator_traits< IC >::difference_type iterator_distance (IC ic1, IC ic2)
 
Iterator_tag query_circulator_or_iterator (const I &i)
 
Circulator_tag query_circulator_or_iterator (const C &c)
 
void set_halfedgeds_items_id (Polyhedron_with_id &P)
 
void set_triangulation_ids (Triangulation &tr)
 
Iterator_range< Halfedge_around_source_iterator< Graph > > halfedges_around_source (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Halfedge_around_source_iterator< Graph > > halfedges_around_source (typename boost::graph_traits< Graph >::vertex_descriptor v, const Graph &g)
 
Iterator_range< Halfedge_around_target_iterator< Graph > > halfedges_around_target (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Halfedge_around_target_iterator< Graph > > halfedges_around_target (typename boost::graph_traits< Graph >::vertex_descriptor v, const Graph &g)
 
Iterator_range< Halfedge_around_face_iterator< Graph > > halfedges_around_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Face_around_target_iterator< Graph > > faces_around_target (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Face_around_face_iterator< Graph > > faces_around_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Vertex_around_target_iterator< Graph > > vertices_around_target (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Vertex_around_face_iterator< Graph > > vertices_around_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
bool is_border (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_border_edge (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_border (typename boost::graph_traits< FaceGraph >::edge_descriptor ed, const FaceGraph &g)
 
boost::optional< typename boost::graph_traits< FaceGraph >::halfedge_descriptor > is_border (typename boost::graph_traits< FaceGraph >::vertex_descriptor vd, const FaceGraph &g)
 
bool is_closed (const FaceGraph &g)
 
bool is_bivalent (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_bivalent_mesh (const FaceGraph &g)
 
bool is_trivalent (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_trivalent_mesh (const FaceGraph &g)
 
bool is_isolated_triangle (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_triangle (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_triangle_mesh (const FaceGraph &g)
 
bool is_isolated_quad (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_quad (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_quad_mesh (const FaceGraph &g)
 
bool is_tetrahedron (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_valid_halfedge_graph (const Graph &g, bool verb=false)
 
bool is_valid_face_graph (const Graph &g, bool verb=false)
 
bool is_valid_polygon_mesh (const Mesh &g, bool verb=false)
 
bool is_hexahedron (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
void clear (FaceGraph &g)
 
bool is_empty (const FaceGraph &g)
 
int vertex_index_in_face (const typename boost::graph_traits< Graph >::vertex_descriptor vd, const typename boost::graph_traits< Graph >::face_descriptor fd, const Graph &g)
 
int halfedge_index_in_face (typename boost::graph_traits< Graph >::halfedge_descriptor he, const Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_triangle (const P &p0, const P &p1, const P &p2, Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_quad (const P &p0, const P &p1, const P &p2, const P &p3, Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_hexahedron (const P &p0, const P &p1, const P &p2, const P &p3, const P &p4, const P &p5, const P &p6, const P &p7, Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_tetrahedron (const P &p0, const P &p1, const P &p2, const P &p3, Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_regular_prism (typename boost::graph_traits< Graph >::vertices_size_type nb_vertices, Graph &g, const P &base_center=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT height=1.0, typename CGAL::Kernel_traits< P >::Kernel::FT radius=1.0, bool is_closed=true)
 
boost::graph_traits< Graph >::halfedge_descriptor make_pyramid (typename boost::graph_traits< Graph >::vertices_size_type nb_vertices, Graph &g, const P &base_center=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT height=1.0, typename CGAL::Kernel_traits< P >::Kernel::FT radius=1.0, bool is_closed=true)
 
boost::graph_traits< Graph >::halfedge_descriptor make_icosahedron (Graph &g, const P &center=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT radius=1)
 
boost::graph_traits< Graph >::halfedge_descriptor make_grid (typename boost::graph_traits< Graph >::vertices_size_type i, typename boost::graph_traits< Graph >::vertices_size_type j, Graph &g, const CoordinateFunctor &calculator, bool triangulated=false)
 
OutputIterator expand_face_selection (const FaceRange &selection, FaceGraph &fg, unsigned int k, IsFaceSelectedPMap is_selected, OutputIterator out)
 
OutputIterator reduce_face_selection (const FaceRange &selection, FaceGraph &fg, unsigned int k, IsFaceSelectedPMap is_selected, OutputIterator out)
 
void regularize_face_selection_borders (TriangleMesh &mesh, IsSelectedMap is_selected, double weight, const NamedParameters &np)
 
OutputIterator select_incident_faces (const HalfedgeRange &hedges, FaceGraph &fg, OutputIterator out)
 
OutputIterator expand_edge_selection (const EdgeRange &selection, HalfedgeGraph &fg, unsigned int k, IsEdgeSelectedPMap is_selected, OutputIterator out)
 
OutputIterator reduce_edge_selection (const EdgeRange &selection, HalfedgeGraph &fg, unsigned int k, IsEdgeSelectedPMap is_selected, OutputIterator out)
 
OutputIterator expand_vertex_selection (const VertexRange &selection, HalfedgeGraph &fg, unsigned int k, IsVertexSelectedPMap is_selected, OutputIterator out)
 
OutputIterator reduce_vertex_selection (const VertexRange &selection, HalfedgeGraph &fg, unsigned int k, IsVertexSelectedPMap is_selected, OutputIterator out)
 
void expand_face_selection_for_removal (const FaceRange &faces_to_be_deleted, TriangleMesh &tm, IsSelectedMap is_selected)
 
void split_graph_into_polylines (const Graph &graph, Visitor &polyline_visitor, IsTerminal is_terminal)
 
void copy_face_graph (const SourceMesh &sm, TargetMesh &tm, const NamedParameters1 &np1, const NamedParameters2 &np2)
 
bool read_off (std::istream &is, Graph &g, const NamedParameters &np)
 
bool read_off (const char *fname, Graph &g, const NamedParameters &np)
 
bool write_off (std::ostream &os, const Graph &g, const NamedParameters &np)
 
bool write_off (const char *fname, const Graph &g, const NamedParameters &np)
 
bool write_vtp (std::ostream &os, const Graph &g, const NamedParameters &np)
 
bool write_wrl (std::ostream &os, const Graph &g, const NamedParameters &np)
 
double alpha_expansion_graphcut (const InputGraph &input_graph, EdgeCostMap edge_cost_map, VertexLabelCostMap vertex_label_cost_map, VertexLabelMap vertex_label_map, const NamedParameters &np)
 
template<class ForwardIterator , class Creator >
void perturb_points_2 (ForwardIterator first, ForwardIterator last, double xeps, double yeps=xeps, Random &rnd=get_default_random(), Creator creator=Creator_uniform_2< Kernel_traits< P >::Kernel::RT, P >)
 perturbs each point in a given range of points by a random amount. More...
 
template<class P , class OutputIterator >
OutputIterator points_on_segment_2 (const P &p, const P &q, std::size_t n, OutputIterator o)
 generates a set of points equally spaced on a segment given the endpoints of the segment. More...
 
template<class OutputIterator , class Creator >
OutputIterator points_on_square_grid_2 (double a, std::size_t n, OutputIterator o, Creator creator=Creator_uniform_2< Kernel_traits< P >::Kernel::RT, P >)
 generates a given number of points on a square grid whose size is determined by the number of points to be generated. More...
 
template<class RandomAccessIterator , class OutputIterator , class Creator >
OutputIterator random_collinear_points_2 (RandomAccessIterator first, RandomAccessIterator last, std::size_t n, OutputIterator first2, Random &rnd=get_default_random(), Creator creator=Creator_uniform_2< Kernel_traits< P >::Kernel::RT, P >)
 randomly chooses two points from the range [first,last), creates a random third point on the segment connecting these two points, writes it to first2, and repeats this \( n\) times, thus writing \( n\) points to first2 that are collinear with points in the range [first,last). More...
 
template<class OutputIterator , class Creator >
OutputIterator points_on_cube_grid_3 (double a, std::size_t n, OutputIterator o, Creator creator=Creator_uniform_3< Kernel_traits< Point_3 >::Kernel::RT, Point_3 >)
 generates a given number of points on a cubic grid whose size is determined by the number of points to be generated. More...
 
template<class OutputIterator , class Creator >
OutputIterator points_on_cube_grid_d (int dim, double a, std::size_t n, OutputIterator o, Creator creator)
 generates a given number of points on a cubic grid in any dimension whose size is determined by the number of points to be generated. More...
 
Randomget_default_random ()
 The global function get_default_random() returns the default random numbers generator used for the generator functions and classes. More...
 
template<class OutputIterator , class Traits , class Generator >
void random_convex_hull_in_disc_2 (std::size_t n, double radius, Generator &gen, OutputIterator it, const Traits &traits, bool fast=true)
 Computes a random convex polygon as the convex hull of \( n \) random points in a disc centered at the origin with radius radius. More...
 
template<class OutputIterator , class PointGenerator , class Traits >
OutputIterator random_convex_set_2 (std::size_t n, OutputIterator o, const PointGenerator &pg, Traits t=Random_convex_set_traits_2)
 computes a random convex planar point set of given size where the points are drawn from a specific domain. More...
 
template<class OutputIterator , class PointGenerator , class Traits >
OutputIterator random_polygon_2 (std::size_t n, OutputIterator result, const PointGenerator &pg, Traits t=Default_traits)
 computes a random simple polygon by writing its vertices (oriented counterclockwise) to result. More...
 
template<class RandomAccessIterator , class Size , class OutputIterator , class Random >
OutputIterator random_selection (RandomAccessIterator first, RandomAccessIterator last, Size n, OutputIterator result, Random &rnd=get_default_random())
 chooses n items at random from a random access iterator range which is useful to produce degenerate input data sets with multiple entries of identical items. More...
 

Variables

 BOUND_REACHED
 
 TIME_LIMIT_REACHED
 
 CANT_IMPROVE_ANYMORE
 
 CONVERGENCE_REACHED
 
 MAX_ITERATION_NUMBER_REACHED
 
 ALL_VERTICES_FROZEN
 
 FACET_VERTICES_ON_SURFACE
 
 FACET_VERTICES_ON_SAME_SURFACE_PATCH
 
 FACET_VERTICES_ON_SAME_SURFACE_PATCH_WITH_ADJACENCY_CHECK
 
 OBTUSE
 
 RIGHT
 
 ACUTE
 
 ON_UNBOUNDED_SIDE
 
 ON_BOUNDARY
 
 ON_BOUNDED_SIDE
 
 SMALLER
 
 EQUAL
 
 LARGER
 
 NEGATIVE
 
 ZERO
 
 POSITIVE
 
 ON_NEGATIVE_SIDE
 
 ON_ORIENTED_BOUNDARY
 
 ON_POSITIVE_SIDE
 
 LEFT_BOUNDARY
 
 RIGHT_BOUNDARY
 
 BOTTOM_BOUNDARY
 
 TOP_BOUNDARY
 
 INTERIOR
 
 EXTERIOR
 
const CGAL::Orientation CLOCKWISE
 
const CGAL::Orientation COUNTERCLOCKWISE
 
const CGAL::Orientation COLLINEAR
 
const CGAL::Orientation LEFT_TURN
 
const CGAL::Orientation RIGHT_TURN
 
const CGAL::Orientation COPLANAR
 
const CGAL::Orientation DEGENERATE
 
const CGAL::Null_vector NULL_VECTOR
 
const CGAL::Origin ORIGIN
 
 ABORT
 
 EXIT
 
 EXIT_WITH_SUCCESS
 
 CONTINUE
 
 THROW_EXCEPTION
 
CGAL::Random default_random