CGAL Namespace Reference

Namespaces
	Barycentric_coordinates
	Box_intersection_d
	Classification
	collect_garbage_internal
	cpp11
	cpp98
	Heat_method_3
	Mesh_2
	OpenGR
	parameters
	Point_set_processing_3
	pointmatcher
	Polygon_mesh_processing
	Polyline_simplification_2
	Qt
	Scale_space_reconstruction_3
	Set_movable_separability_2
	Shape_detection
	Subdivision_method_3
	Surface_mesh_approximation
	Surface_mesh_parameterization
	Surface_mesh_shortest_paths_3
	Surface_mesh_simplification
	Surface_mesh_topology
	Surface_mesher
	Tetrahedral_remeshing

Classes
class	AABB_face_graph_triangle_primitive
class	AABB_halfedge_graph_segment_primitive
class	AABB_polyhedron_segment_primitive
class	AABB_polyhedron_triangle_primitive
struct	AABB_primitive
class	AABB_segment_primitive
class	AABB_traits
class	AABB_tree
class	AABB_triangle_primitive
class	Advancing_front_surface_reconstruction
class	Advancing_front_surface_reconstruction_cell_base_3
class	Advancing_front_surface_reconstruction_vertex_base_3
class	Aff_transformation_2
class	Aff_transformation_3
class	Aff_transformation_d
class	Algebraic_kernel_d_1
class	Algebraic_kernel_d_2
struct	Algebraic_kernel_for_circles_2_2
struct	Algebraic_kernel_for_spheres_2_3
class	Algebraic_kernel_rs_gmpq_d_1
class	Algebraic_kernel_rs_gmpz_d_1
class	Algebraic_structure_traits
class	Alpha_shape_2
class	Alpha_shape_3
class	Alpha_shape_cell_base_3
class	Alpha_shape_face_base_2
class	Alpha_shape_vertex_base_2
class	Alpha_shape_vertex_base_3
class	Alpha_status
struct	Ambient_dimension
class	Apollonius_graph_2
struct	Apollonius_graph_adaptation_traits_2
struct	Apollonius_graph_caching_degeneracy_removal_policy_2
struct	Apollonius_graph_degeneracy_removal_policy_2
class	Apollonius_graph_filtered_traits_2
class	Apollonius_graph_hierarchy_2
class	Apollonius_graph_hierarchy_vertex_base_2
class	Apollonius_graph_traits_2
class	Apollonius_graph_vertex_base_2
class	Apollonius_site_2
class	Approximate_min_ellipsoid_d
struct	Approximate_min_ellipsoid_d_traits_2
struct	Approximate_min_ellipsoid_d_traits_3
struct	Approximate_min_ellipsoid_d_traits_d
class	Arr_accessor
class	Arr_algebraic_segment_traits_2
class	Arr_Bezier_curve_traits_2
class	Arr_circle_segment_traits_2
class	Arr_circular_arc_traits_2
class	Arr_circular_line_arc_traits_2
class	Arr_conic_traits_2
class	Arr_consolidated_curve_data_traits_2
class	Arr_curve_data_traits_2
class	Arr_dcel_base
class	Arr_default_dcel
class	Arr_default_overlay_traits
class	Arr_extended_dcel
class	Arr_extended_dcel_text_formatter
class	Arr_extended_face
class	Arr_extended_halfedge
class	Arr_extended_vertex
class	Arr_face_extended_dcel
class	Arr_face_extended_text_formatter
class	Arr_face_index_map
class	Arr_face_overlay_traits
class	Arr_landmarks_point_location
class	Arr_line_arc_traits_2
class	Arr_linear_traits_2
class	Arr_naive_point_location
class	Arr_non_caching_segment_basic_traits_2
class	Arr_non_caching_segment_traits_2
struct	Arr_oblivious_side_tag
class	Arr_observer
struct	Arr_open_side_tag
struct	Arr_point_location_result
class	Arr_polycurve_traits_2
class	Arr_polyline_traits_2
class	Arr_rational_function_traits_2
class	Arr_segment_traits_2
class	Arr_text_formatter
class	Arr_trapezoid_ric_point_location
class	Arr_vertex_index_map
class	Arr_walk_along_line_point_location
class	Arr_with_history_text_formatter
class	Arrangement_2
class	Arrangement_with_history_2
class	Bbox_2
class	Bbox_3
struct	Bidirectional_circulator_base
class	Bidirectional_circulator_ptrbase
struct	Bidirectional_circulator_tag
struct	Boolean_property_map
struct	Boolean_tag
struct	Cartesian
class	Cartesian_converter
struct	Cartesian_converter_property_map
class	Cartesian_d
struct	Cast_function_object
class	CatmullClark_mask_3
class	CC_safe_handle
class	Cell_attribute
class	Cell_attribute_with_id
class	Cell_attribute_with_point
class	Cell_attribute_with_point_and_id
class	Circle_2
class	Circle_3
class	Circular_arc_2
class	Circular_arc_3
class	Circular_arc_point_2
class	Circular_arc_point_3
struct	Circular_kernel_2
struct	Circulator_base
class	Circulator_from_container
class	Circulator_from_iterator
struct	Circulator_tag
struct	Circulator_traits
struct	Coercion_traits
class	Color
class	Combination_enumerator
class	Combinatorial_map
struct	Combinatorial_map_min_items
struct	Compact
class	Compact_container
class	Compact_container_base
struct	Compact_container_traits
class	Compact_mesh_cell_base_3
class	Compare_to_less
class	Compute_cone_boundaries_2
class	Concurrent_compact_container
struct	Concurrent_compact_container_traits
class	Const_oneset_iterator
struct	Constant_property_map
class	Constrained_Delaunay_triangulation_2
class	Constrained_triangulation_2
class	Constrained_triangulation_face_base_2
class	Constrained_triangulation_plus_2
struct	Construct_array
class	Construct_theta_graph_2
class	Construct_yao_graph_2
class	Container_from_circulator
class	Convex_hull_constructive_traits_2
class	Convex_hull_d
struct	Convex_hull_d_traits_3
class	Convex_hull_traits_2
class	Convex_hull_traits_3
class	Convex_hull_traits_adapter_2
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	Dart
struct	Data_access
struct	Default
class	Deformation_Eigen_closest_rotation_traits_3
class	Deformation_Eigen_polar_closest_rotation_traits_3
class	Delaunay_d
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
class	Delaunay_triangulation_2
class	Delaunay_triangulation_3
struct	Delaunay_triangulation_adaptation_traits_2
struct	Delaunay_triangulation_caching_degeneracy_removal_policy_2
class	Delaunay_triangulation_cell_base_3
class	Delaunay_triangulation_cell_base_with_circumcenter_3
struct	Delaunay_triangulation_degeneracy_removal_policy_2
struct	Dereference
struct	Dereference_property_map
struct	Dimension_tag
class	Direction_2
class	Direction_3
class	Direction_d
class	Dispatch_or_drop_output_iterator
class	Dispatch_output_iterator
class	Distance_adapter
class	DooSabin_mask_3
class	DQQ_stencil_3
class	Dual
struct	Dummy_straight_skeleton_builder_2_visitor
struct	Dynamic_dimension_tag
struct	dynamic_edge_property_t
struct	dynamic_face_property_t
struct	dynamic_halfedge_property_t
class	Dynamic_matrix
struct	dynamic_vertex_property_t
class	Eigen_diagonalize_traits
struct	Eigen_matrix
class	Eigen_solver_traits
class	Eigen_solver_traits< Eigen::BiCGSTAB< Eigen_sparse_matrix< double >::EigenType > >
struct	Eigen_sparse_matrix
struct	Eigen_sparse_symmetric_matrix
class	Eigen_svd
class	Eigen_vector
struct	Emptyset_iterator
class	Env_plane_traits_3
class	Env_sphere_traits_3
class	Env_surface_data_traits_3
class	Env_triangle_traits_3
class	Envelope_diagram_1
class	Envelope_diagram_2
struct	Epeck_d
struct	Epick_d
class	Euclidean_distance
class	Euclidean_distance_sphere_point
struct	Euclidean_ring_tag
class	Euler_integrator_2
class	Exact_circular_kernel_2
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	Exact_spherical_kernel_3
class	Exponent_vector
class	Extended_cartesian
class	Extended_homogeneous
struct	Extremal_polygon_area_traits_2
struct	Extremal_polygon_perimeter_traits_2
class	Extreme_points_traits_adapter_3
class	Face_around_face_circulator
class	Face_around_face_iterator
class	Face_around_target_circulator
class	Face_around_target_iterator
struct	Face_filtered_graph
class	Fair
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
class	Filtered_extended_homogeneous
struct	Filtered_kernel
struct	Filtered_kernel_adaptor
class	Filtered_predicate
struct	First_of_pair_property_map
class	Fixed_alpha_shape_3
class	Fixed_alpha_shape_cell_base_3
class	Fixed_alpha_shape_vertex_base_3
struct	Forward_circulator_base
class	Forward_circulator_ptrbase
struct	Forward_circulator_tag
class	Fourtuple
class	Fraction_traits
class	Fuzzy_iso_box
class	Fuzzy_sphere
class	General_polygon_2
class	General_polygon_set_2
class	General_polygon_with_holes_2
class	Generalized_map
struct	Generic_map_min_items
class	Geomview_stream
struct	Get_address
class	GLPK_mixed_integer_program_traits
class	Gmpfi
class	Gmpfr
class	Gmpq
class	Gmpz
class	Gmpzf
class	Gps_circle_segment_traits_2
class	Gps_default_dcel
class	Gps_face_base
class	Gps_halfedge_base
class	Gps_segment_traits_2
class	Gps_traits_2
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	Gray_level_image_3
class	Greene_convex_decomposition_2
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_const_decorator
class	HalfedgeDS_decorator
class	HalfedgeDS_default
class	HalfedgeDS_face_base
class	HalfedgeDS_face_max_base_with_id
class	HalfedgeDS_face_min_base
class	HalfedgeDS_halfedge_base
class	HalfedgeDS_halfedge_max_base_with_id
class	HalfedgeDS_halfedge_min_base
class	HalfedgeDS_items_2
class	HalfedgeDS_items_decorator
class	HalfedgeDS_list
class	HalfedgeDS_min_items
class	HalfedgeDS_vector
class	HalfedgeDS_vertex_base
class	HalfedgeDS_vertex_max_base_with_id
class	HalfedgeDS_vertex_min_base
struct	Handle_hash_function
class	Hertel_Mehlhorn_convex_decomposition_2
struct	Hilbert_policy
class	Hilbert_sort_2
class	Hilbert_sort_3
class	Hilbert_sort_d
class	Hilbert_sort_on_sphere_3
struct	Homogeneous
class	Homogeneous_converter
class	Homogeneous_d
class	Hyperbolic_Delaunay_triangulation_2
class	Hyperbolic_Delaunay_triangulation_CK_traits_2
class	Hyperbolic_Delaunay_triangulation_traits_2
class	Hyperbolic_octagon_translation
class	Hyperbolic_triangulation_face_base_2
class	Hyperplane_d
struct	Identity
struct	Identity_policy_2
struct	Identity_property_map
class	Identity_transformation
class	Image_3
class	Implicit_mesh_domain_3
class	Implicit_multi_domain_to_labeling_function_wrapper
class	Implicit_surface_3
class	Implicit_to_labeled_subdomains_function_wrapper
class	In_place_list
class	In_place_list_base
class	Incremental_neighbor_search
struct	Input_iterator_property_map
class	Input_rep
class	Insert_iterator
struct	Integral_domain_tag
struct	Integral_domain_without_division_tag
class	Interpolation_gradient_fitting_traits_2
class	Interpolation_traits_2
class	Interval_nt
class	Interval_skip_list
class	Interval_skip_list_interval
class	Inverse_index
class	Ipelet_base
class	Is_convex_2
class	Is_vacuously_valid
class	Is_valid
class	Is_y_monotone_2
class	Iso_box_d
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
class	K_neighbor_search
class	Kd_tree
class	Kd_tree_internal_node
class	Kd_tree_leaf_node
class	Kd_tree_node
class	Kd_tree_rectangle
struct	Kernel_traits
class	Labeled_image_mesh_domain_3
class	Labeled_mesh_domain_3
class	Largest_empty_iso_rectangle_2
class	Lazy_exact_nt
class	Level_interval
class	Line_2
class	Line_3
class	Line_arc_2
class	Line_arc_3
class	Line_d
class	Linear_algebraCd
class	Linear_algebraHd
class	Linear_cell_complex
struct	Linear_cell_complex_bgl_min_items
struct	Linear_cell_complex_for_bgl_combinatorial_map_helper
class	Linear_cell_complex_for_combinatorial_map
class	Linear_cell_complex_for_generalized_map
struct	Linear_cell_complex_min_items
struct	Linear_cell_complex_traits
class	Linear_constraint
class	Linear_mask_3
class	Linear_objective
class	Linear_program_from_iterators
struct	Location_policy
class	Loop_mask_3
class	Manhattan_distance_iso_box_point
struct	Manifold_tag
struct	Manifold_with_boundary_tag
struct	Max
class	Mean_curvature_flow_skeletonization
struct	Median
class	Median_of_max_spread
class	Median_of_rectangle
struct	Memory_sizer
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
struct	Middle
class	Midpoint_of_max_spread
class	Midpoint_of_rectangle
struct	Min
class	Min_annulus_d
class	Min_circle_2
class	Min_circle_2_traits_2
class	Min_ellipse_2
class	Min_ellipse_2_traits_2
struct	Min_quadrilateral_default_traits_2
class	Min_sphere_annulus_d_traits_2
class	Min_sphere_annulus_d_traits_3
class	Min_sphere_annulus_d_traits_d
class	Min_sphere_d
class	Min_sphere_of_points_d_traits_2
class	Min_sphere_of_points_d_traits_3
class	Min_sphere_of_points_d_traits_d
class	Min_sphere_of_spheres_d
class	Min_sphere_of_spheres_d_traits_2
class	Min_sphere_of_spheres_d_traits_3
class	Min_sphere_of_spheres_d_traits_d
class	Mixed_integer_program_traits
class	Modifier_base
class	Modular_traits
class	Monge_via_jet_fitting
class	MP_Float
struct	Mpzf
class	Multiscale_sort
class	Multiset
class	N_step_adaptor
class	Nef_nary_union_3
class	Nef_polyhedron_2
class	Nef_polyhedron_3
class	Nef_polyhedron_S2
struct	No_constraint_intersection_requiring_constructions_tag
struct	No_constraint_intersection_tag
struct	No_intersection_tag
struct	Non_manifold_tag
class	Nonnegative_linear_program_from_iterators
class	Nonnegative_quadratic_program_from_iterators
struct	NT_converter
struct	Nth_of_tuple_property_map
struct	Nth_of_tuple_property_map< N, std::tuple< T... > >
struct	Null_functor
struct	Null_tag
class	Null_vector
class	Number_type_checker
class	Object
class	Oneset_iterator
class	Optimal_convex_decomposition_2
class	Optimal_transportation_reconstruction_2
class	Oriented_bounding_box_traits_3
class	Origin
class	Orthogonal_incremental_neighbor_search
class	Orthogonal_k_neighbor_search
class	Ostream_iterator
class	Output_rep
struct	Parallel_if_available_tag
struct	Parallel_tag
class	Partition_is_valid_traits_2
class	Partition_traits_2
class	Periodic_2_Delaunay_triangulation_2
class	Periodic_2_Delaunay_triangulation_traits_2
class	Periodic_2_offset_2
class	Periodic_2_triangulation_2
class	Periodic_2_triangulation_face_base_2
class	Periodic_2_triangulation_hierarchy_2
class	Periodic_2_triangulation_traits_2
class	Periodic_2_triangulation_vertex_base_2
class	Periodic_3_Delaunay_triangulation_3
class	Periodic_3_Delaunay_triangulation_traits_3
class	Periodic_3_function_wrapper
class	Periodic_3_mesh_triangulation_3
class	Periodic_3_offset_3
class	Periodic_3_regular_triangulation_3
class	Periodic_3_regular_triangulation_traits_3
class	Periodic_3_triangulation_3
class	Periodic_3_triangulation_ds_cell_base_3
class	Periodic_3_triangulation_ds_vertex_base_3
class	Periodic_3_triangulation_hierarchy_3
class	Periodic_3_triangulation_traits_3
class	Periodic_4_hyperbolic_Delaunay_triangulation_2
class	Periodic_4_hyperbolic_Delaunay_triangulation_traits_2
class	Periodic_4_hyperbolic_triangulation_2
class	Periodic_4_hyperbolic_triangulation_face_base_2
class	Periodic_4_hyperbolic_triangulation_vertex_base_2
class	Plane_3
class	Plane_separator
struct	PLY_property
class	Point_2
class	Point_3
class	Point_container
class	Point_d
class	Point_set_2
class	Point_set_3
class	Point_set_with_structure
struct	Pointer_property_map
class	Points_on_segment_2
class	Poisson_reconstruction_function
class	Polygon_2
class	Polygon_mesh_slicer
class	Polygon_nop_decomposition_2
class	Polygon_offset_builder_2
class	Polygon_offset_builder_traits_2
class	Polygon_set_2
class	Polygon_triangulation_decomposition_2
class	Polygon_vertical_decomposition_2
class	Polygon_with_holes_2
class	Polygonal_surface_reconstruction
class	Polyhedral_complex_mesh_domain_3
class	Polyhedral_mesh_domain_3
class	Polyhedral_mesh_domain_with_features_3
class	Polyhedron_3
class	Polyhedron_incremental_builder_3
class	Polyhedron_items_3
class	Polyhedron_items_with_id_3
class	Polyhedron_min_items_3
class	Polyhedron_traits_3
class	Polyhedron_traits_with_normals_3
class	Polynomial
class	Polynomial_1_2
class	Polynomial_1_3
class	Polynomial_for_circles_2_2
class	Polynomial_for_spheres_2_3
class	Polynomial_traits_d
struct	Polynomial_type_generator
class	Polynomials_for_lines_3
class	Polytope_distance_d
class	Polytope_distance_d_traits_2
class	Polytope_distance_d_traits_3
class	Polytope_distance_d_traits_d
class	PQQ_stencil_3
struct	Profile_counter
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_xy_3
class	Projection_traits_xz_3
class	Projection_traits_yz_3
struct	Property_map_to_unary_function
struct	Protect_FPU_rounding
class	Quadratic_program
class	Quadratic_program_from_iterators
class	Quadratic_program_from_mps
class	Quadratic_program_options
class	Quadratic_program_solution
class	Quadruple
class	Quotient
class	Random
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
class	Random_points_in_ball_d
class	Random_points_in_cube_3
class	Random_points_in_cube_d
class	Random_points_in_disc_2
class	Random_points_in_sphere_3
class	Random_points_in_square_2
class	Random_points_in_tetrahedral_mesh_3
class	Random_points_in_tetrahedral_mesh_boundary_3
class	Random_points_in_tetrahedron_3
class	Random_points_in_triangle_2
class	Random_points_in_triangle_3
class	Random_points_in_triangle_mesh_2
struct	Random_points_in_triangle_mesh_3
struct	Random_points_in_triangles_2
struct	Random_points_in_triangles_3
class	Random_points_on_circle_2
class	Random_points_on_segment_2
class	Random_points_on_segment_3
class	Random_points_on_sphere_3
class	Random_points_on_sphere_d
class	Random_points_on_square_2
class	Range_segment_tree_set_traits_2
class	Range_segment_tree_set_traits_3
class	Range_tree_d
class	Range_tree_k
class	Range_tree_map_traits_2
class	Range_tree_map_traits_3
class	Rational_traits
class	Ray_2
class	Ray_3
class	Ray_d
class	Real_embeddable_traits
class	Real_timer
class	Rectangular_p_center_default_traits_2
class	Reflection
class	Regular_grid_2
class	Regular_triangulation
class	Regular_triangulation_2
class	Regular_triangulation_3
struct	Regular_triangulation_adaptation_traits_2
struct	Regular_triangulation_caching_degeneracy_removal_policy_2
class	Regular_triangulation_cell_base_3
class	Regular_triangulation_cell_base_with_weighted_circumcenter_3
struct	Regular_triangulation_degeneracy_removal_policy_2
class	Regular_triangulation_euclidean_traits_3
class	Regular_triangulation_face_base_2
class	Regular_triangulation_traits_adapter
class	Regular_triangulation_vertex_base_2
class	Regular_triangulation_vertex_base_3
class	Residue
class	Ridge_approximation
class	Ridge_line
class	Rigid_triangle_mesh_collision_detection
class	Robust_weighted_circumcenter_filtered_traits_3
class	Root_for_circles_2_2
class	Root_for_spheres_2_3
struct	Root_of_traits
class	Rotation
class	Rotational_sweep_visibility_2
class	Runge_kutta_integrator_2
class	Scale_space_surface_reconstruction_3
class	Scaling
class	SCIP_mixed_integer_program_traits
class	Seam_mesh
class	Search_traits
class	Search_traits_2
class	Search_traits_3
class	Search_traits_adapter
class	Search_traits_d
struct	Second_of_pair_property_map
class	Segment_2
class	Segment_3
class	Segment_d
class	Segment_Delaunay_graph_2
struct	Segment_Delaunay_graph_adaptation_traits_2
struct	Segment_Delaunay_graph_caching_degeneracy_removal_policy_2
struct	Segment_Delaunay_graph_degeneracy_removal_policy_2
struct	Segment_Delaunay_graph_filtered_traits_2
struct	Segment_Delaunay_graph_filtered_traits_without_intersections_2
class	Segment_Delaunay_graph_hierarchy_2
class	Segment_Delaunay_graph_hierarchy_vertex_base_2
class	Segment_Delaunay_graph_Linf_2
struct	Segment_Delaunay_graph_Linf_filtered_traits_2
struct	Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2
class	Segment_Delaunay_graph_Linf_hierarchy_2
struct	Segment_Delaunay_graph_Linf_traits_2
struct	Segment_Delaunay_graph_Linf_traits_without_intersections_2
class	Segment_Delaunay_graph_site_2
class	Segment_Delaunay_graph_storage_site_2
struct	Segment_Delaunay_graph_traits_2
struct	Segment_Delaunay_graph_traits_without_intersections_2
class	Segment_Delaunay_graph_vertex_base_2
class	Segment_tree_d
class	Segment_tree_k
class	Segment_tree_map_traits_2
class	Segment_tree_map_traits_3
struct	Sequential_tag
class	Set_ieee_double_precision
class	Side_of_triangle_mesh
struct	Simple_cartesian
struct	Simple_homogeneous
class	Simple_polygon_visibility_2
class	Sixtuple
class	Sizing_field
class	Skin_surface_3
struct	Skin_surface_polyhedral_items_3
class	Skin_surface_traits_3
class	Sliding_fair
class	Sliding_midpoint
class	Small_side_angle_bisector_decomposition_2
class	Snap_rounding_traits_2
class	Sorted_matrix_search_traits_adaptor
class	Spatial_lock_grid_3
class	Spatial_sort_traits_adapter_2
class	Spatial_sort_traits_adapter_3
class	Spatial_sort_traits_adapter_d
class	Sphere_3
class	Sphere_d
struct	Spherical_kernel_3
class	Sqrt3_mask_3
class	Sqrt_extension
class	Straight_skeleton_2
class	Straight_skeleton_builder_2
class	Straight_skeleton_builder_traits_2
struct	Straight_skeleton_converter_2
class	Straight_skeleton_face_base_2
class	Straight_skeleton_halfedge_base_2
struct	Straight_skeleton_items_converter_2
class	Straight_skeleton_vertex_base_2
class	Stream_lines_2
class	Surface_mesh
class	Surface_mesh_cell_base_3
class	Surface_mesh_complex_2_in_triangulation_3
class	Surface_mesh_default_criteria_3
class	Surface_mesh_default_triangulation_3
class	Surface_mesh_deformation
class	Surface_mesh_shortest_path
class	Surface_mesh_shortest_path_traits
struct	Surface_mesh_traits_generator_3
class	Surface_mesh_vertex_base_3
class	Tetrahedron_3
class	Threetuple
class	Timer
class	Translation
class	Tree_anchor
class	tree_interval_traits
class	tree_point_traits
class	Triangle_2
class	Triangle_3
class	Triangle_accessor_3
class	Triangular_expansion_visibility_2
class	Triangular_field_2
class	Triangulation
class	Triangulation_2
class	Triangulation_3
class	Triangulation_cell_base_3
class	Triangulation_cell_base_with_info_3
class	Triangulation_conformer_2
class	Triangulation_cw_ccw_2
class	Triangulation_data_structure
class	Triangulation_data_structure_2
class	Triangulation_data_structure_3
class	Triangulation_ds_cell_base_3
class	Triangulation_ds_face_base_2
class	Triangulation_ds_full_cell
class	Triangulation_ds_vertex
class	Triangulation_ds_vertex_base_2
class	Triangulation_ds_vertex_base_3
class	Triangulation_face
class	Triangulation_face_base_2
class	Triangulation_face_base_with_id_2
class	Triangulation_face_base_with_info_2
class	Triangulation_full_cell
class	Triangulation_hierarchy_2
class	Triangulation_hierarchy_vertex_base_2
class	Triangulation_simplex_3
struct	Triangulation_utils_3
class	Triangulation_vertex
class	Triangulation_vertex_base_2
class	Triangulation_vertex_base_3
class	Triangulation_vertex_base_with_id_2
class	Triangulation_vertex_base_with_info_2
class	Triangulation_vertex_base_with_info_3
class	Triple
class	Twotuple
class	Umbilic
class	Umbilic_approximation
class	Uncertain
class	Union_find
class	Union_of_balls_3
struct	Unique_factorization_domain_tag
class	Unique_hash_map
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	Variable
class	Variational_shape_approximation
class	Vector_2
class	Vector_3
class	Vector_d
class	Verbose_ostream
class	Vertex_around_face_iterator
class	Vertex_around_target_circulator
class	Vertex_around_target_iterator
class	Voronoi_diagram_2
class	Voronoi_intersection_2_traits_3
class	Weighted_alpha_shape_euclidean_traits_2
class	Weighted_Minkowski_distance
class	Weighted_point_2
class	Weighted_point_3
class	Width_3
class	Width_default_traits_3

Typedefs
typedef Interval_nt< false >	Interval_nt_advanced
typedef unspecified_type	Exact_integer
typedef unspecified_type	Exact_rational
typedef Sign	Orientation
typedef Box_parameter_space_2	Arr_parameter_space
typedef Hilbert_policy< Median >	Hilbert_sort_median_policy
typedef Hilbert_policy< Middle >	Hilbert_sort_middle_policy
typedef Location_policy< Compact >	Compact_location
typedef Location_policy< Fast >	Fast_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	Quadratic_program_pricing_strategy
enum	Quadratic_program_status
enum	Angle
enum	Bounded_side
enum	Comparison_result
enum	Sign
enum	Oriented_side
enum	Box_parameter_space_2
enum	Circle_type
enum	Arr_curve_end
enum	Arr_halfedge_direction
enum	Mesh_optimization_return_code
enum	Mesh_facet_topology
enum	Ridge_order
enum	Ridge_type
enum	Umbilic_type
enum	Failure_behaviour
enum	vertex_index_t
enum	halfedge_index_t
enum	edge_index_t
enum	face_index_t
enum	vertex_point_t

Functions
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)
bool	is_finite (double x)
bool	is_finite (float x)
bool	is_finite (long double x)
OutputIterator	compute_roots_of_2 (const RT &a, const RT &b, const RT &c, OutputIterator oit)
Root_of_traits< RT >::Root_of_2	make_root_of_2 (const RT &a, const RT &b, const RT &c, bool s)
Root_of_traits< RT >::Root_of_2	make_root_of_2 (RT alpha, RT beta, RT gamma)
Root_of_traits< RT >::Root_of_2	make_sqrt (const RT &x)
Rational	simplest_rational_in_interval (double d1, double d2)
Rational	to_rational (double d)
bool	is_valid (const T &x)
T	max (const T &x, const T &y)
T	min (const T &x, const T &y)
Polynomial_traits_d< Polynomial_d >::Canonicalize::result_type	canonicalize (const Polynomial_d &p)
Polynomial_traits_d< Polynomial_d >::Compare::result_type	compare (const Polynomial_d &p, const Polynomial_d &q)
Polynomial_traits_d< Polynomial_d >::Degree::result_type	degree (const Polynomial_d &p, int i, index=Polynomial_traits_d< Polynomial_d >::d-1)
Polynomial_traits_d< Polynomial_d >::Degree_vector::result_type	degree_vector (const Polynomial_d &p)
Polynomial_traits_d< Polynomial_d >::Differentiate::result_type	differentiate (const Polynomial_d &p, index=Polynomial_traits_d< Polynomial_d >::d-1)
Polynomial_traits_d< Polynomial_d >::Evaluate_homogeneous::result_type	evaluate_homogeneous (const Polynomial_d &p, Polynomial_traits_d< Polynomial_d >::Coefficient_type u, Polynomial_traits_d< Polynomial_d >::Coefficient_type v)
Polynomial_traits_d< Polynomial_d >::Evaluate::result_type	evaluate (const Polynomial_d &p, Polynomial_traits_d< Polynomial_d >::Coefficient_type x)
Polynomial_traits_d< Polynomial_d >::Gcd_up_to_constant_factor::result_type	gcd_up_to_constant_factor (const Polynomial_d &p, const Polynomial_d &q)
Polynomial_traits_d< Polynomial_d >::get_coefficient::result_type	get_coefficient (const Polynomial_d &p, int i)
Polynomial_traits_d< Polynomial_d >::get_innermost_coefficient::result_type	get_innermost_coefficient (const Polynomial_d &p, Exponent_vector ev)
Polynomial_traits_d< Polynomial_d >::Innermost_leading_coefficient::result_type	innermost_leading_coefficient (const Polynomial_d &p)
Polynomial_traits_d< Polynomial_d >::Integral_division_up_to_constant_factor::result_type	integral_division_up_to_constant_factor (const Polynomial_d &p, const Polynomial_d &q)
Polynomial_traits_d< Polynomial_d >::Invert::result_type	invert (const Polynomial_d &p, int index=Polynomial_traits_d< Polynomial_d >::d-1)
Polynomial_traits_d< Polynomial_d >::Is_square_free::result_type	is_square_free (const Polynomial_d &p)
Polynomial_traits_d< Polynomial_d >::Is_zero_at_homogeneous::result_type	is_zero_at_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end)
Polynomial_traits_d< Polynomial_d >::Is_zero_at::result_type	is_zero_at (const Polynomial_d &p, InputIterator begin, InputIterator end)
Polynomial_traits_d< Polynomial_d >::Leading_coefficient::result_type	leading_coefficient (const Polynomial_d &p)
Polynomial_traits_d< Polynomial_d >::Make_square_free::result_type	make_square_free (const Polynomial_d &p)
Polynomial_traits_d< Polynomial_d >::Move::result_type	move (const Polynomial_d &p, int i, int j)
Polynomial_traits_d< Polynomial_d >::Multivariate_content::result_type	multivariate_content (const Polynomial_d &p)
Polynomial_traits_d< Polynomial_d >::Negate::result_type	negate (const Polynomial_d &p, int index=Polynomial_traits_d< Polynomial_d >::d-1)
int	number_of_real_roots (Polynomial_d f)
int	number_of_real_roots (InputIterator start, InputIterator end)
Polynomial_traits_d< Polynomial_d >::Permute::result_type	permute (const Polynomial_d &p, InputIterator begin, InputIterator end)
OutputIterator	polynomial_subresultants (Polynomial_d p, Polynomial_d q, OutputIterator out)
OutputIterator1	polynomial_subresultants_with_cofactors (Polynomial_d p, Polynomial_d q, OutputIterator1 sres_out, OutputIterator2 coP_out, OutputIterator3 coQ_out)
OutputIterator	principal_sturm_habicht_sequence (typename Polynomial_d f, OutputIterator out)
OutputIterator	principal_subresultants (Polynomial_d p, Polynomial_d q, OutputIterator out)
void	pseudo_division (const Polynomial_d &f, const Polynomial_d &g, Polynomial_d &q, Polynomial_d &r, Polynomial_traits_d< Polynomial_d >::Coefficient_type &D)
Polynomial_traits_d< Polynomial_d >::Pseudo_division_quotient::result_type	pseudo_division_quotient (const Polynomial_d &p, const Polynomial_d &q)
Polynomial_traits_d< Polynomial_d >::Pseudo_division_remainder::result_type	pseudo_division_remainder (const Polynomial_d &p, const Polynomial_d &q)
Polynomial_traits_d< Polynomial_d >::Resultant::result_type	resultant (const Polynomial_d &p, const Polynomial_d &q)
Polynomial_traits_d< Polynomial_d >::Scale_homogeneous::result_type	scale_homogeneous (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &u, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &v, int index=Polynomial_traits_d< Polynomial_d >::d-1)
Polynomial_traits_d< Polynomial_d >::Scale::result_type	scale (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &a, int index=Polynomial_traits_d< Polynomial_d >::d-1)
Polynomial_traits_d< Polynomial_d >::Shift::result_type	shift (const Polynomial_d &p, int i, int index=Polynomial_traits_d< Polynomial_d >::d-1)
Polynomial_traits_d< Polynomial_d >::Sign_at_homogeneous::result_type	sign_at_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end)
Polynomial_traits_d< Polynomial_d >::Sign_at::result_type	sign_at (const Polynomial_d &p, InputIterator begin, InputIterator end)
OutputIterator	square_free_factorize (const Polynomial_d &p, OutputIterator it, Polynomial_traits_d< Polynomial >::Innermost_coefficient &a)
OutputIterator	square_free_factorize (const Polynomial_d &p, OutputIterator it)
OutputIterator	square_free_factorize_up_to_constant_factor (const Polynomial_d &p, OutputIterator it)
OutputIterator	sturm_habicht_sequence (Polynomial_d f, OutputIterator out)
OutputIterator1	sturm_habicht_sequence_with_cofactors (Polynomial_d f, OutputIterator1 stha_out, OutputIterator2 cof_out, OutputIterator3 cofx_out)
CGAL::Coercion_traits< Polynomial_traits_d< Polynomial_d >::Innermost_coefficient, std::iterator_traits< Input_iterator >::value_type >::Type	substitute_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end)
CGAL::Coercion_traits< Polynomial_traits_d< Polynomial_d >::Innermost_coefficient, std::iterator_traits< Input_iterator >::value_type >::Type	substitute (const Polynomial_d &p, InputIterator begin, InputIterator end)
Polynomial_traits_d< Polynomial_d >::Swap::result_type	swap (const Polynomial_d &p, int i, int j)
Polynomial_traits_d< Polynomial_d >::Total_degree::result_type	total_degree (const Polynomial_d &p)
Polynomial_traits_d< Polynomial_d >::Translate_homogeneous::result_type	translate_homogeneous (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &u, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &v, int index=Polynomial_traits_d< Polynomial_d >::d-1)
Polynomial_traits_d< Polynomial_d >::Translate::result_type	translate (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &a, int index=Polynomial_traits_d< Polynomial_d >::d-1)
Polynomial_traits_d< Polynomial_d >::Univariate_content::result_type	univariate_content (const Polynomial_d &p)
Polynomial_traits_d< Polynomial_d >::Univariate_content_up_to_constant_factor::result_type	univariate_content_up_to_constant_factor (const Polynomial_d &p)
void	monotone_matrix_search (const Matrix &m, RandomAccessIC t, const Compare_strictly &compare_strictly=less< Matrix::Value >())
Traits::Value	sorted_matrix_search (RandomAccessIterator f, RandomAccessIterator l, const Traits &t)
void	print_linear_program (std::ostream &out, const LinearProgram &lp, const std::string &problem_name=std::string("MY_MPS"))
void	print_nonnegative_linear_program (std::ostream &out, const NonnegativeLinearProgram &lp, const std::string &problem_name=std::string("MY_MPS"))
void	print_nonnegative_quadratic_program (std::ostream &out, const NonnegativeQuadraticProgram &qp, const std::string &problem_name=std::string("MY_MPS"))
void	print_quadratic_program (std::ostream &out, const QuadraticProgram &qp, const std::string &problem_name=std::string("MY_MPS"))
Quadratic_program_solution< ET >	solve_linear_program (const LinearProgram &lp, const ET &, const Quadratic_program_options &options=Quadratic_program_options())
Quadratic_program_solution< ET >	solve_nonnegative_linear_program (const NonnegativeLinearProgram &lp, const ET &, const Quadratic_program_options &options=Quadratic_program_options())
Quadratic_program_solution< ET >	solve_nonnegative_quadratic_program (const NonnegativeQuadraticProgram &qp, const ET &, const Quadratic_program_options &options=Quadratic_program_options())
Quadratic_program_solution< ET >	solve_quadratic_program (const QuadraticProgram &qp, const ET &, const Quadratic_program_options &options=Quadratic_program_options())
Linear_program_from_iterators< A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, C_it >	make_linear_program_from_iterators (int n, int m, const A_it &a, const B_it &b, const R_it &r, const FL_it &fl, const L_it &l, const FU_it &fu, const U_it &u, const C_it &c, std::iterator_traits< C_it >::value_type c0=std::iterator_traits< C_it >::value_type(0))
Nonnegative_linear_program_from_iterators< A_it, B_it, R_it, C_it >	make_nonnegative_linear_program_from_iterators (int n, int m, const A_it &a, const B_it &b, const R_it &r, const C_it &c, std::iterator_traits< C_it >::value_type c0=std::iterator_traits< C_it >::value_type(0))
Nonnegative_quadratic_program_from_iterators< A_it, B_it, R_it, D_it, C_it >	make_nonnegative_quadratic_program_from_iterators (int n, int m, const A_it &a, const B_it &b, const R_it &r, const D_it &d, const C_it &c, std::iterator_traits< C_it >::value_type c0=std::iterator_traits< C_it >::value_type(0))
Quadratic_program_from_iterators< A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it >	make_quadratic_program_from_iterators (int n, int m, const A_it &a, const B_it &b, const R_it &r, const FL_it &fl, const L_it &l, const FU_it &fu, const U_it &u, const D_it &d, const C_it &c, std::iterator_traits< C_it >::value_type c0=std::iterator_traits< C_it >::value_type(0))
T	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)
cpp11::result_of< Kernel::Intersect_23(Type1, Type2)>::type	intersection (Type1< Kernel > obj1, Type2< Kernel > obj2)
boost::optional< boost::variant< Point_3, Line_3, Plane_3 > >	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< Kernel >	barycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2)
CGAL::Point_2< Kernel >	barycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2)
CGAL::Point_2< Kernel >	barycenter (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< Kernel >	barycenter (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< Kernel >	barycenter (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< Kernel >	barycenter (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< Kernel >	barycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2)
CGAL::Point_3< Kernel >	barycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2)
CGAL::Point_3< Kernel >	barycenter (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< Kernel >	barycenter (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< Kernel >	barycenter (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< Kernel >	barycenter (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< Kernel >	bisector (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
CGAL::Line_2< Kernel >	bisector (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2)
CGAL::Plane_3< Kernel >	bisector (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
CGAL::Plane_3< Kernel >	bisector (const CGAL::Plane_3< Kernel > &h1, const CGAL::Plane_3< Kernel > &h2)
CGAL::Point_2< Kernel >	centroid (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
CGAL::Point_2< Kernel >	centroid (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< Kernel >	centroid (const CGAL::Triangle_2< Kernel > &t)
CGAL::Point_3< Kernel >	centroid (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
CGAL::Point_3< Kernel >	centroid (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< Kernel >	centroid (const CGAL::Triangle_3< Kernel > &t)
CGAL::Point_3< Kernel >	centroid (const CGAL::Tetrahedron_3< Kernel > &t)
CGAL::Point_2< Kernel >	circumcenter (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
CGAL::Point_2< Kernel >	circumcenter (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
CGAL::Point_2< Kernel >	circumcenter (const CGAL::Triangle_2< Kernel > &t)
CGAL::Point_3< Kernel >	circumcenter (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
CGAL::Point_3< Kernel >	circumcenter (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
CGAL::Point_3< Kernel >	circumcenter (const CGAL::Triangle_3< Kernel > &t)
CGAL::Point_3< Kernel >	circumcenter (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< Kernel >	circumcenter (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_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< Kernel >	cross_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< Kernel >	equidistant_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< Kernel >	max_vertex (const CGAL::Iso_rectangle_2< Kernel > &ir)
CGAL::Point_3< Kernel >	max_vertex (const CGAL::Iso_cuboid_3< Kernel > &ic)
CGAL::Point_2< Kernel >	midpoint (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
CGAL::Point_3< Kernel >	midpoint (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
CGAL::Point_2< Kernel >	min_vertex (const CGAL::Iso_rectangle_2< Kernel > &ir)
CGAL::Point_3< Kernel >	min_vertex (const CGAL::Iso_cuboid_3< Kernel > &ic)
CGAL::Vector_3< Kernel >	normal (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< Kernel >	orthogonal_vector (const CGAL::Plane_3< Kernel > &p)
CGAL::Vector_3< Kernel >	orthogonal_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< Kernel >	radical_plane (const CGAL::Sphere_3< Kernel > &s1, const CGAL::Sphere_3< Kernel > &s2)
CGAL::Line_2< Kernel >	radical_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< Kernel >	unit_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)
Point_d< R >	center_of_sphere (ForwardIterator first, ForwardIterator last)
Point_d< R >	lift_to_paraboloid (const Point_d< R > &p)
OutputIterator	linear_base (ForwardIterator first, ForwardIterator last, OutputIterator result)
Point_d< R >	midpoint (const Point_d< R > &p, const Point_d< R > &q)
Point_d< R >	project_along_d_axis (const Point_d< R > &p)
FT	squared_distance (Point_d< R > p, Point_d< R > q)
bool	do_intersect (Type1< R > obj1, Type2< R > obj2)
cpp11::result_of< R::Intersect_d(Type1< R >, Type2< R >)>::type	intersection (Type1< R > f1, Type2< R > f2)
bool	affinely_independent (ForwardIterator first, ForwardIterator last)
int	affine_rank (ForwardIterator first, ForwardIterator last)
Comparison_result	compare_lexicographically (const Point_d< R > &p, const Point_d< R > &q)
bool	contained_in_affine_hull (ForwardIterator first, ForwardIterator last, const Point_d< R > &p)
bool	contained_in_linear_hull (ForwardIterator first, ForwardIterator last, const Vector_d< R > &v)
bool	contained_in_simplex (ForwardIterator first, ForwardIterator last, const Point_d< R > &p)
bool	lexicographically_smaller (const Point_d< R > &p, const Point_d< R > &q)
bool	lexicographically_smaller_or_equal (const Point_d< R > &p, const Point_d< R > &q)
bool	linearly_independent (ForwardIterator first, ForwardIterator last)
int	linear_rank (ForwardIterator first, ForwardIterator last)
Orientation	orientation (ForwardIterator first, ForwardIterator last)
Bounded_side	side_of_bounded_sphere (ForwardIterator first, ForwardIterator last, const Point_d< R > &p)
Oriented_side	side_of_oriented_sphere (ForwardIterator first, ForwardIterator last, const Point_d< R > &p)
bool	has_in_x_range (const Circular_arc_2< CircularKernel > &ca, const Circular_arc_point_2< CircularKernel > &p)
bool	has_in_x_range (const Line_arc_2< CircularKernel > &ca, const Circular_arc_point_2< CircularKernel > &p)
bool	has_on (const Circle_2< CircularKernel > &c, const Circular_arc_point_2< CircularKernel > &p)
OutputIterator	make_x_monotone (const Circular_arc_2< CircularKernel > &ca, OutputIterator res)
OutputIterator	make_xy_monotone (const Circular_arc_2< CircularKernel > &ca, OutputIterator res)
Circular_arc_point_2< CircularKernel >	x_extremal_point (const Circle_2< CircularKernel > &c, bool b)
OutputIterator	x_extremal_points (const Circle_2< CircularKernel > &c, OutputIterator res)
Circular_arc_point_2< CircularKernel >	y_extremal_point (const Circle_2< CircularKernel > &c, bool b)
OutputIterator	y_extremal_points (const Circle_2< CircularKernel > &c, OutputIterator res)
CGAL::Comparison_result	compare_y_to_right (const Circular_arc_2< CircularKernel > &ca1, const Circular_arc_2< CircularKernel > &ca2, Circular_arc_point_2< CircularKernel > &p)
CGAL::Circle_type	classify (const CGAL::Circle_3< SphericalKernel > &c, const CGAL::Sphere_3< SphericalKernel > &sphere)
Comparison_result	compare_theta (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q, const CGAL::Sphere_3< SphericalKernel > &sphere)
Comparison_result	compare_theta (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Vector_3< SphericalKernel > &m, const CGAL::Sphere_3< SphericalKernel > &sphere)
Comparison_result	compare_theta (const CGAL::Vector_3< SphericalKernel > &m, const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Sphere_3< SphericalKernel > &sphere)
bool	compare_theta_z (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q, const CGAL::Sphere_3< SphericalKernel > &sphere)
bool	is_theta_monotone (const CGAL::Circular_arc_3< SphericalKernel > &a, const CGAL::Sphere_3< SphericalKernel > &sphere)
CGAL::Circular_arc_point_3< SphericalKernel >	theta_extremal_point (const CGAL::Circle_3< SphericalKernel > &c, const CGAL::Sphere_3< SphericalKernel > sphere, bool b)
OutputIterator	theta_extremal_points (const CGAL::Circle_3< SphericalKernel > &c, const CGAL::Sphere_3< SphericalKernel > &sphere, OutputIterator res)
CGAL::Circular_arc_point_3< SphericalKernel >	x_extremal_point (const CGAL::Sphere_3< SphericalKernel > &c, bool b)
CGAL::Circular_arc_point_3< SphericalKernel >	x_extremal_point (const CGAL::Circle_3< SphericalKernel > &c, bool b)
OutputIterator	x_extremal_points (const CGAL::Sphere_3< SphericalKernel > &c, OutputIterator res)
OutputIterator	x_extremal_points (const CGAL::Circle_3< SphericalKernel > &c, OutputIterator res)
CGAL::Circular_arc_point_3< SphericalKernel >	y_extremal_point (const CGAL::Sphere_3< SphericalKernel > &c, bool b)
CGAL::Circular_arc_point_3< SphericalKernel >	y_extremal_point (const CGAL::Circle_3< SphericalKernel > &c, bool b)
OutputIterator	y_extremal_points (const CGAL::Sphere_3< SphericalKernel > &c, OutputIterator res)
OutputIterator	y_extremal_points (const CGAL::Circle_3< SphericalKernel > &c, OutputIterator res)
CGAL::Circular_arc_point_3< SphericalKernel >	z_extremal_point (const CGAL::Sphere_3< SphericalKernel > &c, bool b)
CGAL::Circular_arc_point_3< SphericalKernel >	z_extremal_point (const CGAL::Circle_3< SphericalKernel > &c, bool b)
OutputIterator	z_extremal_points (const CGAL::Sphere_3< SphericalKernel > &c, OutputIterator res)
OutputIterator	z_extremal_points (const CGAL::Circle_3< SphericalKernel > &c, OutputIterator res)
OutputIterator	ch_akl_toussaint (ForwardIterator first, ForwardIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits())
OutputIterator	ch_bykat (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
OutputIterator	ch_eddy (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
OutputIterator	ch_graham_andrew (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
OutputIterator	ch_graham_andrew_scan (BidirectionalIterator first, BidirectionalIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
OutputIterator	ch_jarvis (ForwardIterator first, ForwardIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
OutputIterator	ch_jarvis_march (ForwardIterator first, ForwardIterator beyond, const Traits::Point_2 &start_p, const Traits::Point_2 &stop_p, OutputIterator result, const Traits &ch_traits=Default_traits)
OutputIterator	ch_melkman (InputIterator first, InputIterator last, OutputIterator result, const Traits &ch_traits=Default_traits)
void	ch_e_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &e, const Traits &ch_traits=Default_traits)
void	ch_n_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, const Traits &ch_traits=Default_traits)
void	ch_ns_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, ForwardIterator &s, const Traits &ch_traits=Default_traits)
void	ch_nswe_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, ForwardIterator &s, ForwardIterator &w, ForwardIterator &e, const Traits &ch_traits=Default_traits)
void	ch_s_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &s, const Traits &ch_traits=Default_traits)
void	ch_we_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &w, ForwardIterator &e, const Traits &ch_traits=Default_traits)
void	ch_w_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &w, const Traits &ch_traits=Default_traits)
OutputIterator	convex_hull_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits)
OutputIterator	convex_hull_2 (InputIterator first, InputIterator beyond, OutputIterator result)
OutputIterator	lower_hull_points_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
OutputIterator	upper_hull_points_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits)
bool	is_ccw_strongly_convex_2 (ForwardIterator first, ForwardIterator beyond, const Traits &ch_traits=Default_traits)
bool	is_cw_strongly_convex_2 (ForwardIterator first, ForwardIterator beyond, const Traits &ch_traits=Default_traits)
void	halfspace_intersection_3 (PlaneIterator begin, PlaneIterator end, PolygonMesh &pm, boost::optional< Kernel_traits< std::iterator_traits< PlaneIterator >::value_type >::Kernel::Point_3 > > origin=boost::none)
void	halfspace_intersection_with_constructions_3 (PlaneIterator pbegin, PlaneIterator pend, PolygonMesh &pm, boost::optional< Kernel_traits< std::iterator_traits< PlaneIterator >::value_type >::Kernel::Point_3 > > origin=boost::none, const Traits &ch_traits=Default_traits)
void	convex_hull_3 (InputIterator first, InputIterator last, PolygonMesh &pm, const Traits &ch_traits=Default_traits)
void	convex_hull_3 (const VertexListGraph &g, PolygonMesh &pm, const NamedParameters &np)
void	convex_hull_3 (InputIterator first, InputIterator last, Object &ch_object, const Traits &ch_traits=Default_traits)
OutputIterator	extreme_points_3 (InputRange range, OutputIterator out, const Traits &traits)
void	convex_hull_3_to_face_graph (const Triangulation &T, PolygonMesh &pm)
bool	is_strongly_convex_3 (PolygonMesh &pm, const Traits &traits=Default_traits)
Extreme_points_traits_adapter_3< PointPropertyMap, Base_traits >	make_extreme_points_traits_adapter (const PointPropertyMap &pmap, Base_traits traits)
void	complement (const Polygon_2< Kernel, Container > &pgn, Polygon_with_holes_2< Kernel, Container > &res)
void	complement (const General_polygon_2< Traits > &pgn, General_polygon_with_holes_2< Traits > &res)
OutputIterator	complement (const Polygon_with_holes_2< Kernel, Container > &pgn, OutputIterator oi)
OutputIterator	complement (const General_polygon_with_holes_2< General_polygon_2< Traits > > &pgn, OutputIterator oi)
OutputIterator	difference (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	difference (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	difference (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	difference (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	difference (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi)
OutputIterator	difference (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi)
OutputIterator	difference (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, OutputIterator oi)
OutputIterator	difference (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2, OutputIterator oi)
bool	do_intersect (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2)
bool	do_intersect (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2)
bool	do_intersect (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2)
bool	do_intersect (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2)
bool	do_intersect (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2)
bool	do_intersect (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2)
bool	do_intersect (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2)
bool	do_intersect (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2)
bool	do_intersect (InputIterator begin, InputIterator end)
bool	do_intersect (InputIterator1 pgn_begin1, InputIterator1 pgn_end1, InputIterator2 pgn_begin2, InputIterator2 pgn_end2)
OutputIterator	intersection (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	intersection (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	intersection (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	intersection (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	intersection (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi)
OutputIterator	intersection (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi)
OutputIterator	intersection (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, OutputIterator oi)
OutputIterator	intersection (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2, OutputIterator oi)
OutputIterator	intersection (InputIterator begin, InputIterator end, OutputIterator oi)
OutputIterator	intersection (InputIterator1 pgn_begin1, InputIterator1 pgn_end1, InputIterator2 pgn_begin2, InputIterator2 pgn_end2, OutputIterator oi)
bool	join (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, General_polygon_with_holes_2< Polygon_2< Kernel, Container > > &res)
bool	join (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, General_polygon_with_holes_2< Polygon_2< Kernel, Container > > &res)
bool	join (const Polygon_with_holes_2< Kernel, Container > &p2, const Polygon_2< Kernel, Container > &p1, General_polygon_with_holes_2< Polygon_2< Kernel, Container > > &res)
bool	join (const Polygon_with_holes_2< Kernel, Container > &p2, const Polygon_with_holes_2< Kernel, Container > &p1, General_polygon_with_holes_2< Polygon_2< Kernel, Container > > &res)
bool	join (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2, General_polygon_with_holes_2< General_polygon_2< Traits > > &res)
bool	join (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, General_polygon_with_holes_2< General_polygon_2< Traits > > &res)
bool	join (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, const General_polygon_2< Traits > &p1, General_polygon_with_holes_2< General_polygon_2< Traits > > &res)
bool	join (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2, Traits::Polygon_with_holes_2 &res)
OutputIterator	join (InputIterator begin, InputIterator end, OutputIterator oi)
OutputIterator	join (InputIterator1 pgn_begin1, InputIterator1 pgn_end1, InputIterator2 pgn_begin2, InputIterator2 pgn_end2, OutputIterator oi)
Oriented_side	oriented_side (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2)
Oriented_side	oriented_side (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2)
Oriented_side	oriented_side (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2)
Oriented_side	oriented_side (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2)
Oriented_side	oriented_side (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2)
Oriented_side	oriented_side (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2)
Oriented_side	oriented_side (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2)
Oriented_side	oriented_side (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2)
OutputIterator	symmetric_difference (const Type1 &p1, const Type2 &p2, OutputIterator oi)
OutputIterator	symmetric_difference (const Polygon_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	symmetric_difference (const Polygon_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &p1, const Polygon_with_holes_2< Kernel, Container > &p2, OutputIterator oi)
OutputIterator	symmetric_difference (const General_polygon_2< Traits > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi)
OutputIterator	symmetric_difference (const General_polygon_with_holes_2< General_polygon_2< Traits > > &p1, const General_polygon_2< Traits > &p2, OutputIterator oi)
OutputIterator	symmetric_difference (const General_polygon_2< Traits > &p1, const General_polygon_with_holes_2< General_polygon_2< Traits > > &p2, OutputIterator oi)
OutputIterator	symmetric_difference (const General_polygon_with_holes_2< Polygon > &p1, const General_polygon_with_holes_2< Polygon > &p2, OutputIterator oi)
OutputIterator	symmetric_difference (InputIterator begin, InputIterator end, OutputIterator oi)
OutputIterator	symmetric_difference (InputIterator1 pgn_begin1, InputIterator1 pgn_end1, InputIterator2 pgn_begin2, InputIterator2 pgn_end2, OutputIterator oi)
OutputIterator	connect_holes (const Polygon_with_holes_2< Kernel, Container > &pwh, OutputIterator oi)
bool	is_y_monotone_2 (InputIterator first, InputIterator beyond, const Traits &traits)
OutputIterator	approx_convex_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits)
OutputIterator	greene_approx_convex_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits)
OutputIterator	optimal_convex_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits)
OutputIterator	y_monotone_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits)
bool	convex_partition_is_valid_2 (InputIterator point_first, InputIterator point_beyond, ForwardIterator poly_first, ForwardIterator poly_beyond, const Traits &traits=Default_traits)
bool	partition_is_valid_2 (InputIterator point_first, InputIterator point_beyond, ForwardIterator poly_first, ForwardIterator poly_beyond, const Traits &traits=Default_traits)
bool	y_monotone_partition_is_valid_2 (InputIterator point_first, InputIterator point_beyond, ForwardIterator poly_first, ForwardIterator poly_beyond, const Traits &traits=Default_traits)
bool	arrange_offset_polygons_2 (InputPolygonPtrIterator begin, InputPolygonPtrIterator end, OutputPolygonWithHolesPtrIterator out, K const &k)
boost::optional< typename Traits::FT >	compute_outer_frame_margin (InputIterator first, InputIterator beyond, typename Traits::FT offset, Traits const &traits=Default_traits)
std::vector< boost::shared_ptr< Polygon > >	create_offset_polygons_2 (FT offset, StraightSkeleton const &s,, K const &k=Exact_predicates_inexact_constructions_kernel)
std::vector< boost::shared_ptr< Polygon > >	create_exterior_skeleton_and_offset_polygons_2 (FT offset, Polygon const &poly, OffsettingK ofk=Exact_predicates_inexact_constructions_kernel, SkeletonK ssk=Exact_predicates_inexact_constructions_kernel)
std::vector< boost::shared_ptr< Polygon > >	create_interior_skeleton_and_offset_polygons_2 (FT offset, Polygon const &outer_boundary, HoleIterator holes_begin, HoleIterator holes_end, OffsettingK ofk=CGAL::Exact_predicates_inexact_constructions_kernel, SkeletonK ssk=CGAL::Exact_predicates_inexact_constructions_kernel)
std::vector< boost::shared_ptr< Polygon > >	create_interior_skeleton_and_offset_polygons_2 (FT offset, Polygon const &poly, OffsettingK ofk=CGAL::Exact_predicates_inexact_constructions_kernel, SkeletonK ssk=CGAL::Exact_predicates_inexact_constructions_kernel)
std::vector< boost::shared_ptr< Polygon_with_holes_2< OffsettingK, C > > >	create_exterior_skeleton_and_offset_polygons_with_holes_2 (FT offset, CGAL::Polygon_2< OffsettingK, C > poly_with_holes, OffsettingK ofk=Exact_predicates_inexact_constructions_kernel, SkeletonK ssk=Exact_predicates_inexact_constructions_kernel)
std::vector< boost::shared_ptr< Polygon_2< OffsettingK, C > > >	create_interior_skeleton_and_offset_polygons_2 (FT offset, CGAL::Polygon_with_holes< OffsettingK, C > poly_with_holes, OffsettingK ofk=CGAL::Exact_predicates_inexact_constructions_kernel, SkeletonK ssk=CGAL::Exact_predicates_inexact_constructions_kernel)
std::vector< boost::shared_ptr< Polygon_with_holes_2< OffsettingK, C > > >	create_interior_skeleton_and_offset_polygons_with_holes_2 (FT offset, CGAL::Polygon_2< OffsettingK, C > poly, OffsettingK ofk=CGAL::Exact_predicates_inexact_constructions_kernel, SkeletonK ssk=CGAL::Exact_predicates_inexact_constructions_kernel)
std::vector< boost::shared_ptr< Polygon_with_holes_2< OffsettingK, C > > >	create_interior_skeleton_and_offset_polygons_with_holes_2 (FT offset, CGAL::Polygon_with_holes_2< OffsettingK, C > poly_with_holes, OffsettingK ofk=CGAL::Exact_predicates_inexact_constructions_kernel, SkeletonK ssk=CGAL::Exact_predicates_inexact_constructions_kernel)
boost::shared_ptr< Straight_skeleton_2< K > >	create_exterior_straight_skeleton_2 (FT max_offset, PointIterator vertices_begin, PointIterator vertices_end, K const &k=Exact_predicates_inexact_constructions_kernel)
boost::shared_ptr< Straight_skeleton_2< K > >	create_exterior_straight_skeleton_2 (FT max_offset, Polygon P, K const &k=Exact_predicates_inexact_constructions_kernel)
boost::shared_ptr< Straight_skeleton_2< K > >	create_interior_straight_skeleton_2 (PointIterator outer_contour_vertices_begin, PointIterator outer_contour_vertices_end, HoleIterator holes_begin, HoleIterator holes_end, K const &k=Exact_predicates_inexact_constructions_kernel)
boost::shared_ptr< Straight_skeleton_2< K > >	create_interior_straight_skeleton_2 (PointIterator outer_contour_vertices_begin, PointIterator outer_contour_vertices_end, K const &k=Exact_predicates_inexact_constructions_kernel)
boost::shared_ptr< Straight_skeleton_2< K > >	create_interior_straight_skeleton_2 (Polygon const &outer_contour, K const &k=Exact_predicates_inexact_constructions_kernel)
boost::shared_ptr< Straight_skeleton_2< K > >	create_interior_straight_skeleton_2 (Polygon_with_holes< K, C > poly_with_holes, K const &k=Exact_predicates_inexact_constructions_kernel)
boost::shared_ptr< Target_skeleton, Source_skeleton, Items_converter >	convert_straight_skeleton_2 (Source_skeleton const &s, Items_converted const &ic=Items_converter())
OutputIterator	approximated_inset_2 (const Polygon_2< Kernel, Container > &pgn, const typename Kernel::FT &r, const double &eps, OutputIterator oi)
Gps_circle_segment_traits_2< Kernel >::Polygon_with_holes_2	approximated_offset_2 (const Polygon_2< Kernel, Container > &P, const typename Kernel::FT &r, const double &eps)
Gps_circle_segment_traits_2< Kernel >::Polygon_with_holes_2	approximated_offset_2 (const Polygon_with_holes_2< Kernel, Container > &wh, const typename Kernel::FT &r, const double &eps)
Gps_circle_segment_traits_2< Kernel >::Polygon_with_holes_2	approximated_offset_2 (const Polygon_2< Kernel, Container > &P, const typename Kernel::FT &r, const double &eps, const DecompositionStrategy &decomp)
Polygon_with_holes_2< Kernel, Container >	minkowski_sum_2 (const PolygonType1< Kernel, Container > &P, const PolygonType2< Kernel, Container > &Q)
Polygon_with_holes_2< Kernel, Container >	minkowski_sum_by_reduced_convolution_2 (const PolygonType1< Kernel, Container > &P, const PolygonType2< Kernel, Container > &Q)
Polygon_with_holes_2< Kernel, Container >	minkowski_sum_by_full_convolution_2 (const Polygon_2< Kernel, Container > &P, const Polygon_2< Kernel, Container > &Q)
Polygon_with_holes_2< Kernel, Container >	minkowski_sum_2 (const PolygonType1< Kernel, Container > &P, const PolygonType2< Kernel, Container > &Q, const PolygonConvexDecompositionP_2_ &decomp_P, const PolygonConvexDecompositionQ_2_ &decomp_Q, const Gps_segment_traits_2 &traits=Gps_segment_traits_2< Kernel, Container, Arr_segment_traits >())
Polygon_with_holes_2< Kernel, Container >	minkowski_sum_2 (const PolygonType1< Kernel, Container > &P, const PolygonType2< Kernel, Container > &Q, const PolygonConvexDecomposition_2_ &decomp, const Gps_segment_traits_2 &traits=Gps_segment_traits_2< Kernel, Container, Arr_segment_traits >())
Polygon_with_holes_2< Kernel, Container >	minkowski_sum_by_decomposition_2 (const PolygonType1< Kernel, Container > &P, const PolygonType2< Kernel, Container > &Q, const PolygonNoHolesConvexDecomposition_2_ &no_holes_decomp, const PolygonWithHolesConvexDecomposition_2_ &with_holes_decomp, const Gps_segment_traits_2 &traits=Gps_segment_traits_2< Kernel, Container, Arr_segment_traits >())
OutputIterator	inset_polygon_2 (const Polygon_2< typename ConicTraits::Rat_kernel, Container > &P, const typename ConicTraits::Rat_kernel::FT &r, const ConicTraits &traits, OutputIterator oi)
Gps_traits_2< ConicTraits >::Polygon_with_holes_2	offset_polygon_2 (const Polygon_2< typename ConicTraits::Rat_kernel, Container > &P, const typename ConicTraits::Rat_kernel::FT &r, const ConicTraits &traits)
Gps_traits_2< ConicTraits >::Polygon_with_holes_2	offset_polygon_2 (const Polygon_with_holes_2< typename ConicTraits::Rat_kernel, Container > &pwh, const typename ConicTraits::Rat_kernel::FT &r, const ConicTraits &traits)
Gps_traits_2< ConicTraits >::Polygon_with_holes_2	offset_polygon_2 (const Polygon_2< typename ConicTraits::Rat_kernel, Container > &P, const typename ConicTraits::Rat_kernel::FT &r, const DecompositionStrategy &decomp, const ConicTraits &traits)
void	draw (const POLY &apoly)
bool	read_off (Surface_mesh< K > &mesh, const std::string &filename)
bool	write_off (const Surface_mesh< K > &mesh, const std::string &filename)
bool	read_mesh (Surface_mesh< K > &mesh, const std::string &filename)
bool	write_mesh (const Surface_mesh< K > &mesh, const std::string &filename)
void	generic_print_surface_mesh (std::ostream &out, const Surface_mesh< P > &M, Writer &writer)
int	read_3mf (const std::string &file_name, std::vector< CGAL::Surface_mesh< Point > > &output)
bool	write_off (std::ostream &os, const Surface_mesh< P > &sm)
bool	read_off (std::istream &is, Surface_mesh< P > &sm)
CMap::Dart_handle	make_combinatorial_hexahedron (CMap &cm)
CMap::Dart_handle	make_combinatorial_polygon (CMap &cm, unsigned int lg)
CMap::Dart_handle	make_combinatorial_tetrahedron (CMap &cm)
CMap::Dart_handle	make_edge (CMap &cm)
CMap::Dart_handle	insert_cell_0_in_cell_1 (CMap &cm, typename CMap::Dart_handle dh)
CMap::Dart_handle	insert_cell_0_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh)
CMap::Dart_handle	insert_cell_1_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh1, typename CMap::Dart_handle dh2)
CMap::Dart_handle	insert_cell_2_in_cell_3 (CMap &cm, InputIterator afirst, InputIterator alast)
CMap::Dart_handle	insert_dangling_cell_1_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh)
bool	is_insertable_cell_1_in_cell_2 (const CMap &cm, typename CMap::Dart_const_handle dh1, typename CMap::Dart_const_handle dh2)
bool	is_insertable_cell_2_in_cell_3 (const CMap &cm, InputIterator afirst, InputIterator alast)
bool	is_removable (const CMap &cm, typename CMap::Dart_const_handle dh)
CMap::size_type	remove_cell (CMap &cm, typename CMap::Dart_handle dh)
void	draw (const LCC &alcc)
LCC::Dart_handle	import_from_plane_graph (LCC &lcc, std::istream &ais)
LCC::Vector	compute_normal_of_cell_0 (const LCC &lcc, typename LCC::Dart_const_handle dh)
LCC::Vector	compute_normal_of_cell_2 (const LCC &lcc, typename LCC::Dart_const_handle dh)
LCC::Dart_handle	import_from_polyhedron_3 (LCC &lcc, const Polyhedron &apoly)
LCC::Dart_handle	import_from_triangulation_3 (LCC &lcc, const Triangulation_ &atr)
void	convert_nef_polyhedron_to_polygon_mesh (const Nef_polyhedron &nef, Polygon_mesh &pm, bool triangulate_all_faces=false)
void	convert_nef_polyhedron_to_polygon_soup (const Nef_polyhedron &nef, PointRange &points, PolygonRange &polygons, bool triangulate_all_faces=false)
void	draw (const Nef3 &anef3)
istream &	operator>> (std::istream &in, CGAL::Nef_polyhedron_3< Traits > &N)
ostream &	operator<< (std::ostream &out, CGAL::Nef_polyhedron_3< Traits > &N)
std::size_t	OFF_to_nef_3 (std::istream &in, Nef_polyhedron_3 &N)
void	convex_decomposition_3 (Nef_polyhedron &N)
OutputIterator	locate (const Arrangement_2< Traits, Dcel > &arr, InputIterator points_begin, InputIterator points_end, OutputIterator oi)
void	overlay (const Arrangement_2< GeomTraitsA, TopTraitsA > &arr1, const Arrangement_2< GeomTraitsB, TopTraitsB > &arr2, Arrangement_2< GeomTraitsRes, TopTraitsRes > &arr_res, OverlayTraits &ovl_tr)
void	overlay (const Arrangement_with_history_2< Traits, Dcel1 > &arr1, const Arrangement_with_history_2< Traits, Dcel2 > &arr2, Arrangement_with_history_2< Traits, ResDcel > &res, OverlayTraits &ovl_tr)
OutputIterator	decompose (const Arrangement_2< Traits, Dcel > &arr, OutputIterator oi)
bool	do_intersect (Arrangement_on_surface_2< GeomTraits, TopTraits > &arr, const Curve &c, const PointLocation &pl)
Arrangement_2< Traits, Dcel >::Halfedge_handle	insert_non_intersecting_curve (Arrangement_2< Traits, Dcel > &arr, const typename Traits::X_monotone_curve_2 &xc, const PointLocation &pl=walk_pl)
void	insert_non_intersecting_curves (Arrangement_2< Traits, Dcel > &arr, InputIterator first, InputIterator last)
Arrangement_2< Traits, Dcel >::Vertex_handle	insert_point (Arrangement_2< Traits, Dcel > &arr, const typename Traits::Point_2 &p, const PointLocation &pl=walk_pl)
bool	is_valid (const Arrangement_2< Traits, Dcel > &arr)
Arrangement_2< Traits, Dcel >::Face_handle	remove_edge (Arrangement_2< Traits, Dcel > &arr, typename Arrangement_2< Traits, Dcel >::Halfedge_handle e)
bool	remove_vertex (Arrangement_2< Traits, Dcel > &arr, typename Arrangement_2< Traits, Dcel >::Vertex_handle v)
OutputIterator	zone (Arrangement_on_surface_2< GeomTraits, TopTraits > &arr, const typename GeomTraits::X_monotone_curve_2 &c, OutputIterator oi, const PointLocation &pl)
Arrangement_with_history_2< Traits, Dcel >::Curve_handle	insert (Arrangement_with_history_2< Traits, Dcel > &arr, const typename Traits::Curve_2 &c, const PointLocation &pl=walk_pl)
void	insert (Arrangement_with_history_2< Traits, Dcel > &arr, InputIterator first, InputIterator last)
Size	remove_curve (Arrangement_with_history_2< Traits, Dcel > &arr, typename Arrangement_with_history_2< Traits, Dcel >::Curve_handle ch)
void	overlay (const Arrangement_with_history_2< Traits, Dcel1 > &arr1, const Arrangement_with_history_2< Traits, Dcel2 > &arr2, Arrangement_with_history_2< Traits, ResDcel > &res)
std::istream &	read (Arrangement_2< Traits, Dcel > &arr, std::istream &is, Formatter &formatter)
std::ostream &	write (const Arrangement_2< Traits, Dcel > &arr, std::ostream &os, Formatter &formatter)
std::ostream &	operator<< (std::ostream &os, const Arrangement_2< Traits, Dcel > &arr)
std::istream &	operator>> (std::istream &is, Arrangement_2< Traits, Dcel > &arr)
std::istream &	read (Arrangement_with_history_2< Traits, Dcel > &arr, std::istream &is, WithHistoryFormatter &formatter)
std::ostream &	write (const Arrangement_with_history_2< Traits, Dcel > &arr, std::ostream &os, WithHistoryFormatter &formatter)
std::ostream &	operator<< (std::ostream &os, const Arrangement_with_history_2< Traits, Dcel > &arr)
std::istream &	operator>> (std::istream &is, Arrangement_with_history_2< Traits, Dcel > &arr)
void	insert (Arrangement_2< Traits, Dcel > &arr, const Curve &c, const PointLocation &pl=walk_pl)
void	insert (Arrangement_2< Traits, Dcel > &arr, const typename Traits::X_monotone_curve_2 &xc, const Object &obj)
void	insert (Arrangement_2< Traits, Dcel > &arr, InputIterator first, InputIterator last)
OutputIterator	compute_intersection_points (InputIterator curves_begin, InputIterator curves_end, OutputIterator points, bool report_endpoints=false)
OutputIterator	compute_intersection_points (InputIterator curves_begin, InputIterator curves_end, OutputIterator points, bool report_endpoints=false, Traits traits)
OutputIterator	compute_subcurves (InputIterator curves_begin, InputIterator curves_end, OutputIterator subcurves, bool multiple_overlaps=false)
OutputIterator	compute_subcurves (InputIterator curves_begin, InputIterator curves_end, OutputIterator subcurves, bool multiple_overlaps=false, Traits traits=Default_traits())
bool	do_curves_intersect (InputIterator curves_begin, InputIterator curves_end)
bool	do_curves_intersect (InputIterator curves_begin, InputIterator curves_end, Traits traits=Default_traits())
void	snap_rounding_2 (InputIterator begin, InputIterator end, OutputContainer &output_container, typename Traits::FT pixel_size, bool do_isr=true, bool int_output=true, unsigned int number_of_kd_trees=1)
void	lower_envelope_2 (InputIterator begin, InputIterator end, EnvelopeDiagram &diag)
void	lower_envelope_x_monotone_2 (InputIterator begin, InputIterator end, EnvelopeDiagram &diag)
void	upper_envelope_2 (InputIterator begin, InputIterator end, EnvelopeDiagram &diag)
void	upper_envelope_x_monotone_2 (InputIterator begin, InputIterator end, EnvelopeDiagram &diag)
void	lower_envelope_3 (InputIterator begin, InputIterator end, Envelope_diagram_2< Traits > &diag)
void	lower_envelope_xy_monotone_3 (InputIterator begin, InputIterator end, Envelope_diagram_2< Traits > &diag)
void	upper_envelope_3 (InputIterator begin, InputIterator end, Envelope_diagram_2< Traits > &diag)
void	upper_envelope_xy_monotone_3 (InputIterator begin, InputIterator end, Envelope_diagram_2< Traits > &diag)
void	draw (const T2 &at2)
void	draw (const P2T2 &ap2t2)
void	draw (const T3 &at3)
boost::graph_trait< FG >::vertex_descriptor	link_to_face_graph (const Triangulation &t, typename Triangulation::Vertex_handle vh, TriangleMesh &tm, bool no_infinite_faces=true)
void	draw (const V2 &av2)
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)
void	write_vtu (std::ostream &os, const CDT &tr, IO::Mode mode=IO::BINARY)
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)
bool	output_surface_facets_to_off (std::ostream &os, const SurfaceMeshComplex_2InTriangulation_3 &c2t3, int options=Surface_mesher::IO_ORIENT_SURFACE)
void	facets_in_complex_2_to_triangle_mesh (const C2T3 &c2t3, TriangleMesh &graph)
bool	output_surface_facets_to_polyhedron (const SurfaceMeshComplex_2InTriangulation_3 &c2t3, Polyhedron &output_polyhedron)
void	make_surface_mesh (SurfaceMeshC2T3 &c2t3, Surface surface, FacetsCriteria criteria, Tag tag, int initial_number_of_points=20)
void	make_surface_mesh (SurfaceMeshC2T3 &c2t3, SurfaceMeshTraits::Surface_3 surface, SurfaceMeshTraits traits, FacetsCriteria criteria, Tag tag, int initial_number_of_points=20)
void	make_skin_surface_mesh_3 (Polyhedron &p, WP_iterator begin, WP_iterator end, double shrink_factor=.5, int nSubdivisions=0, bool grow_balls=true)
void	mesh_skin_surface_3 (const SkinSurface_3 &skin_surface, Polyhedron &p)
void	subdivide_skin_surface_mesh_3 (const SkinSurface_3 &skin_surface, Polyhedron &p, int nSubdiv=1)
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)
void	output_to_medit (std::ostream &os, const C3T3 &c3t3, bool rebind=false, bool show_patches=false)
void	output_to_vtu (std::ostream &os, const C3T3 &c3t3, IO::Mode mode=IO::BINARY)
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())
OutputIterator	compute_crest_ridges (const TriangleMesh &tm, VertexFTMap vertex_k1_pm, VertexFTMap vertex_k2_pm, VertexFTMap vertex_b0_pm, VertexFTMap vertex_b3_pm, VertexVectorMap vertex_d1_pm, VertexVectorMap vertex_d2_pm, VertexFTMap vertex_P1_pm, VertexFTMap vertex_P2_pm, OutputIterator it, CGAL::Ridge_order order=CGAL::Ridge_order_3)
OutputIterator	compute_max_ridges (const TriangleMesh &tm, VertexFTMap vertex_k1_pm, VertexFTMap vertex_k2_pm, VertexFTMap vertex_b0_pm, VertexFTMap vertex_b3_pm, VertexVectorMap vertex_d1_pm, VertexVectorMap vertex_d2_pm, VertexFTMap vertex_P1_pm, const VertexFTMap vertex_P2_pm, OutputIterator it, CGAL::Ridge_order order=CGAL::Ridge_order_3)
OutputIterator	compute_min_ridges (const TriangleMesh &tm, VertexFTMap vertex_k1_pm, VertexFTMap vertex_k2_pm, VertexFTMap vertex_b0_pm, VertexFTMap vertex_b3_pm, VertexVectorMap vertex_d1_pm, VertexVectorMap vertex_d2_pm, VertexFTMap vertex_P1_pm, VertexFTMap vertex_P2_pm, OutputIterator it, CGAL::Ridge_order order=CGAL::Ridge_order_3)
OutputIterator	compute_umbilics (const TriangleMesh &tm, VertexFTMap vertex_k1_pm, VertexFTMap vertex_k2_pm, VertexVectorMap vertex_d1_pm, VertexVectorMap vertex_d2_pm, OutputIterator it, double size)
bool	read_xyz_point_set (std::istream &stream, CGAL::Point_set_3< Point, Vector > &point_set)
bool	read_off_point_set (std::istream &stream, CGAL::Point_set_3< Point, Vector > &point_set)
bool	read_ply_point_set (std::istream &stream, CGAL::Point_set_3< Point, Vector > &point_set, std::string &comments)
bool	write_ply_point_set (std::ostream &stream, const CGAL::Point_set_3< Point, Vector > &point_set, const std::string &comments=std::string())
bool	read_las_point_set (std::istream &stream, CGAL::Point_set_3< Point, Vector > &point_set)
bool	write_las_point_set (std::ostream &stream, CGAL::Point_set_3< Point, Vector > &point_set)
bool	write_xyz_point_set (std::ostream &stream, const CGAL::Point_set_3< Point, Vector > &point_set)
bool	write_off_point_set (std::ostream &stream, const CGAL::Point_set_3< Point, Vector > &point_set)
void	draw (const PS &aps)
std::tuple< PointMap, typename Kernel_traits< typename PointMap::value_type >::Kernel::Construct_point_3, LAS_property::X, LAS_property::Y, LAS_property::Z >	make_las_point_reader (PointMap point_map)
bool	read_las_points_with_properties (std::istream &stream, OutputIterator output, PropertyHandler &&... properties)
bool	read_las_points (std::istream &stream, OutputIterator output, const NamedParameters &np)
bool	read_off_points (std::istream &stream, OutputIterator output, const NamedParameters &np)
std::tuple< PointMap, typename Kernel_traits< typename PointMap::value_type >::Kernel::Construct_point_3, PLY_property< FT >, PLY_property< FT >, PLY_property< FT > >	make_ply_point_reader (PointMap point_map)
std::tuple< VectorMap, typename Kernel_traits< typename VectorMap::value_type >::Kernel::Construct_vector_3, PLY_property< FT >, PLY_property< FT >, PLY_property< FT > >	make_ply_normal_reader (VectorMap normal_map)
bool	read_ply_points_with_properties (std::istream &stream, OutputIterator output, PropertyHandler &&... properties)
bool	read_ply_points (std::istream &stream, OutputIterator output, const NamedParameters &np)
bool	read_xyz_points (std::istream &stream, OutputIterator output, const NamedParameters &np)
std::tuple< PointMap, LAS_property::X, LAS_property::Y, LAS_property::Z >	make_las_point_writer (PointMap point_map)
bool	write_las_points_with_properties (std::ostream &stream, const PointRange &points, std::tuple< PointMap, LAS_property::X, LAS_property::Y, LAS_property::Z > point_property, PropertyHandler &&... properties)
bool	write_las_points (std::ostream &stream, const PointRange &points, const NamedParameters &np)
bool	write_off_points (std::ostream &stream, const PointRange &points, const NamedParameters &np)
std::tuple< PointMap, PLY_property< FT >, PLY_property< FT >, PLY_property< FT > >	make_ply_point_writer (PointMap point_map)
std::tuple< VectorMap, PLY_property< FT >, PLY_property< FT >, PLY_property< FT > >	make_ply_normal_writer (VectorMap normal_map)
bool	write_ply_points_with_properties (std::ostream &stream, const PointRange &points, PropertyHandler &&... properties)
bool	write_ply_points (std::ostream &stream, const PointRange &points, const NamedParameters &np)
bool	write_xyz_points (std::ostream &stream, const PointRange &points, const NamedParameters &np)
double	bilateral_smooth_point_set (PointRange &points, unsigned int k, const NamedParameters &np)
std::size_t	cluster_point_set (PointRange &points, ClusterMap cluster_map, const NamedParameters &np)
FT	compute_average_spacing (const PointRange &points, unsigned int k, const CGAL_BGL_NP_CLASS &np)
OutputIterator	edge_aware_upsample_point_set (const PointRange &points, OutputIterator output, const NamedParameters &np)
OutputIterator	estimate_local_k_neighbor_scales (const PointRange &points, const QueryPointRange &queries, OutputIterator output, const NamedParameters &np)
std::size_t	estimate_global_k_neighbor_scale (const PointRange &points, const NamedParameters &np)
OutputIterator	estimate_local_range_scales (const PointRange &points, const QueryPointRange &queries, OutputIterator output, const NamedParameters &np)
FT	estimate_global_range_scale (const PointRange &points, const NamedParameters &np)
PointRange::iterator	grid_simplify_point_set (PointRange &points, double epsilon, const NamedParameters &np)
PointRange::iterator	hierarchy_simplify_point_set (PointRange &points, const NamedParameters &np)
void	jet_estimate_normals (PointRange &points, unsigned int k, const NamedParameters &np)
void	jet_smooth_point_set (PointRange &points, unsigned int k, const NamedParameters &np)
PointRange::iterator	mst_orient_normals (PointRange &points, unsigned int k, const NamedParameters &np)
void	pca_estimate_normals (PointRange &points, unsigned int k, const NamedParameters &np)
PointRange::iterator	random_simplify_point_set (PointRange &points, double removed_percentage)
PointRange::iterator	remove_outliers (PointRange &points, unsigned int k, const NamedParameters &np)
OutputIterator	structure_point_set (const PointRange &points, const PlaneRange &planes, OutputIterator output, double epsilon, const NamedParameters &np)
bool	vcm_is_on_feature_edge (std::array< FT, 6 > &cov, double threshold, VCMTraits)
bool	vcm_is_on_feature_edge (std::array< FT, 6 > &cov, double threshold)
void	compute_vcm (const PointRange &points, std::vector< std::array< double, 6 > > &ccov, double offset_radius, double convolution_radius, const NamedParameters &np)
void	vcm_estimate_normals (PointRange &points, double offset_radius, double convolution_radius, const NamedParameters &np)
void	vcm_estimate_normals (PointRange &points, double offset_radius, unsigned int k, const NamedParameters &np)
OutputIterator	wlop_simplify_and_regularize_point_set (PointRange &points, OutputIterator output, const NamedParameters &np)
void	draw (const Mesh &amesh, const std::vector< Path_on_surface< Mesh > > &apaths)
void	draw (const Mesh &amesh, std::initializer_list< Path_on_surface< Mesh > > &apaths)
Dt::Vertex_handle	nearest_neighbor (const Dt &delau, Dt::Vertex_handle v)
OutputIterator	nearest_neighbors (Dt &delau, const Dt::Point &p, Dt::size_type k, OutputIterator res)
OutputIterator	nearest_neighbors (Dt &delau, Dt::Vertex_handle v, Dt::size_type k, OutputIterator res)
OutputIterator	range_search (Dt &delau, const Circle &C, OutputIterator res)
OutputIterator	range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, OutputIterator res)
OutputIterator	range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, const Dt::Point &d, OutputIterator res)
OutputIterator	range_search (Dt &delau, const Circle &C, OutputIterator res, Pred &pred, bool return_if_succeded)
OutputIterator	range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, OutputIterator res, Pred &pred, bool return_if_succeded)
OutputIterator	range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, const Dt::Point &d, OutputIterator res, Pred &pred, bool return_if_succeded)
void	box_intersection_all_pairs_d (ForwardIterator1 begin1, ForwardIterator1 end1, ForwardIterator2 begin2, ForwardIterator2 end2, Callback callback, CGAL::Box_intersection_d::Topology topology=CGAL::Box_intersection_d::CLOSED)
void	box_intersection_all_pairs_d (ForwardIterator1 begin1, ForwardIterator1 end1, ForwardIterator2 begin2, ForwardIterator2 end2, Callback callback, BoxTraits box_traits, CGAL::Box_intersection_d::Topology topology=CGAL::Box_intersection_d::CLOSED)
void	box_intersection_d (RandomAccessIterator1 begin1, RandomAccessIterator1 end1, RandomAccessIterator2 begin2, RandomAccessIterator2 end2, Callback callback, std::ptrdiff_t cutoff=10, CGAL::Box_intersection_d::Topology topology=CGAL::Box_intersection_d::CLOSED, CGAL::Box_intersection_d::Setting setting=CGAL::Box_intersection_d::BIPARTITE)
void	box_intersection_d (RandomAccessIterator1 begin1, RandomAccessIterator1 end1, RandomAccessIterator2 begin2, RandomAccessIterator2 end2, Callback callback, BoxTraits box_traits, std::ptrdiff_t cutoff=10, CGAL::Box_intersection_d::Topology topology=CGAL::Box_intersection_d::CLOSED, CGAL::Box_intersection_d::Setting setting=CGAL::Box_intersection_d::BIPARTITE)
void	box_self_intersection_all_pairs_d (ForwardIter begin, ForwardIter end, Callback callback, CGAL::Box_intersection_d::Topology topology=CGAL::Box_intersection_d::CLOSED)
void	box_self_intersection_all_pairs_d (ForwardIter begin, ForwardIter end, Callback callback, BoxTraits box_traits, CGAL::Box_intersection_d::Topology topology=CGAL::Box_intersection_d::CLOSED)
void	box_self_intersection_d (RandomAccessIterator begin, RandomAccessIterator end, Callback callback, std::ptrdiff_t cutoff=10, CGAL::Box_intersection_d::Topology topology=CGAL::Box_intersection_d::CLOSED)
void	box_self_intersection_d (RandomAccessIterator begin, RandomAccessIterator end, Callback callback, BoxTraits box_traits, std::ptrdiff_t cutoff=10, CGAL::Box_intersection_d::Topology topology=CGAL::Box_intersection_d::CLOSED)
void	hilbert_sort (InputPointIterator begin, InputPointIterator end, const Traits &traits=Default_traits, PolicyTag policy=Default_policy)
void	hilbert_sort_on_sphere (InputPointIterator begin, InputPointIterator end, const Traits &traits=Default_traits, PolicyTag policy=Default_policy, double sqr_radius=1.0, const Traits::Point_3 &center=Default_center)
void	spatial_sort (InputPointIterator begin, InputPointIterator end, const Traits &traits=Default_traits, PolicyTag policy=Default_policy, std::ptrdiff_t threshold_hilbert=default, std::ptrdiff_t threshold_multiscale=default, double ratio=default)
void	spatial_sort_on_sphere (InputPointIterator begin, InputPointIterator end, const Traits &traits=Default_traits, PolicyTag policy=Default_policy, double sqr_radius=1.0, const Traits::Point_3 &center=Default_center, std::ptrdiff_t threshold_hilbert=default, std::ptrdiff_t threshold_multiscale=default, double ratio=default)
OutputIterator	min_parallelogram_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
OutputIterator	min_rectangle_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
OutputIterator	min_strip_2 (ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
OutputIterator	rectangular_p_center_2 (ForwardIterator f, ForwardIterator l, OutputIterator o, FT &r, int p, const Traits &t=Default_traits)
OutputIterator	extremal_polygon_2 (RandomAccessIterator points_begin, RandomAccessIterator points_end, int k, OutputIterator o, const Traits &t)
OutputIterator	maximum_area_inscribed_k_gon_2 (RandomAccessIterator points_begin, RandomAccessIterator points_end, int k, OutputIterator o)
OutputIterator	maximum_perimeter_inscribed_k_gon_2 (RandomAccessIterator points_begin, RandomAccessIterator points_end, int k, OutputIterator o)
OutputIterator	all_furthest_neighbors_2 (RandomAccessIterator points_begin, RandomAccessIterator points_end, OutputIterator o, Traits t=Default_traits)
Deduced	barycenter (InputIterator first, InputIterator beyond)
Deduced	barycenter (InputIterator first, InputIterator beyond, const K &k)
Deduced	centroid (InputIterator first, InputIterator beyond, const Tag &t)
Deduced	centroid (InputIterator first, InputIterator beyond, const K &k, const Tag &t)
K::FT	linear_least_squares_fitting_2 (InputIterator first, InputIterator beyond, typename K::Line_2 &line, typename K::Point_2 &centroid, const Tag &tag, const K &k, const DiagonalizeTraits_ &diagonalize_traits)
Deduced	bounding_box (InputIterator first, InputIterator beyond)
Deduced	bounding_box (InputIterator first, InputIterator beyond, const K &k)
K::FT	linear_least_squares_fitting_3 (InputIterator first, InputIterator beyond, typename K::Line_3 &line, typename K::Point_3 &centroid, const Tag &tag, const K &k, const DiagonalizeTraits_ &diagonalize_traits)
K::FT	linear_least_squares_fitting_3 (InputIterator first, InputIterator beyond, typename K::Plane_3 &plane, typename K::Point_3 &centroid, const Tag &tag, const K &k, const DiagonalizeTraits_ &diagonalize_traits)
ValueFunctor::result_type::first_type	linear_interpolation (CoordinateInputIterator first, CoordinateInputIterator beyond, const typename std::iterator_traits< CoordinateInputIterator >::value_type::second_type &norm, ValueFunctor value_function)
ValueFunctor::result_type	quadratic_interpolation (CoordinateInputIterator first, CoordinateInputIterator beyond, const typename std::iterator_traits< CoordinateInputIterator >::value_type::second_type &norm, const Point &p, ValueFunctor value_function, GradFunctor gradient_function, const Traits &traits)
std::pair< typename ValueFunctor::result_type, bool >	sibson_c1_interpolation (CoordinateInputIterator first, CoordinateInputIterator beyond, const typename std::iterator_traits< CoordinateInputIterator >::value_type::second_type &norm, const Point &p, ValueFunctor value_function, GradFunctor gradient_function, const Traits &traits)
ValueFunctor::result_type	sibson_c1_interpolation_square (CoordinateInputIterator first, CoordinateInputIterator beyond, const typename std::iterator_traits< CoordinateInputIterator >::value_type::second_type &norm, const Point &p, ValueFunctor value_function, GradFunctor gradient_function, const Traits &traits)
ValueFunctor::result_type	farin_c1_interpolation (CoordinateInputIterator first, CoordinateInputIterator beyond, const typename std::iterator_traits< CoordinateInputIterator >::value_type::second_type &norm, const Point &p, ValueFunctor value_function, GradFunctor gradient_function, const Traits &traits)
CGAL::Triple< CoordinateOutputIterator, typename Dt::Geom_traits::FT, bool >	natural_neighbor_coordinates_2 (const Dt &dt, const typename Dt::Geom_traits::Point_2 &p, CoordinateOutputIterator out, OutputFunctor fct, typename Dt::Face_handle start=typename Dt::Face_handle())
CGAL::Triple< CoordinateOutputIterator, typename Dt::Geom_traits::FT, bool >	natural_neighbor_coordinates_2 (const Dt &dt, const typename Dt::Geom_traits::Point_2 &p, CoordinateOutputIterator out, OutputFunctor fct, EdgeIterator hole_begin, EdgeIterator hole_end)
CGAL::Triple< CoordinateOutputIterator, typename Dt::Geom_traits::FT, bool >	natural_neighbor_coordinates_2 (const Dt &dt, typename Dt::Vertex_handle vh, CoordinateOutputIterator out, OutputFunctor fct)
CGAL::Triple< CoordinateOutputIterator, typename Rt::Geom_traits::FT, bool >	regular_neighbor_coordinates_2 (const Rt &rt, const typename Rt::Weighted_point &p, CoordinateOutputIterator out, OutputFunctor fct, typename Rt::Face_handle start=typename Rt::Face_handle())
CGAL::Triple< CoordinateOutputIterator, typename Traits::FT, bool >	regular_neighbor_coordinates_2 (const Rt &rt, const typename Traits::Weighted_point &p, CoordinateOutputIterator out, OutputFunctor fct, EdgeIterator hole_begin, EdgeIterator hole_end, VertexIterator hidden_vertices_begin, VertexIterator hidden_vertices_end)
CGAL::Triple< CoordinateOutputIterator, typename Rt::Geom_traits::FT, bool >	regular_neighbor_coordinates_2 (const Rt &rt, typename Rt::Vertex_handle vh, CoordinateOutputIterator out, OutputFunctor fct)
Traits::Vector_d	sibson_gradient_fitting (CoordinateInputIterator first, CoordinateInputIterator beyond, const typename std::iterator_traits< CoordinateInputIterator >::value_type::second_type &norm, const Point &p, ValueFunctor value_function, const typename ValueFunctor::result_type::first_type fn, const Traits &traits)
GradientOutputIterator	sibson_gradient_fitting_nn_2 (const Dt &dt, GradientOutputIterator out, OutputFunctor fct, ValueFunctor value_function, const Traits &traits)
GradientOutputIterator	sibson_gradient_fitting_rn_2 (const Rt &rt, GradientOutputIterator out, OutputFunctor fct, ValueFunctor value_function, const Traits &traits)
CGAL::Triple< OutputIterator, typename Kernel::FT, bool >	surface_neighbor_coordinates_3 (InputIterator first, InputIterator beyond, const typename Kernel::Point_3 &p, const typename Kernel::Vector_3 &normal, OutputIterator out, const Kernel &K)
CGAL::Triple< OutputIterator, typename ITraits::FT, bool >	surface_neighbor_coordinates_3 (InputIterator first, InputIterator beyond, const typename ITraits::Point_2 &p, OutputIterator out, const ITraits &traits)
CGAL::Quadruple< OutputIterator, typename Kernel::FT, bool, bool >	surface_neighbor_coordinates_certified_3 (InputIterator first, InputIterator beyond, const typename Kernel::Point_3 &p, const typename Kernel::Vector_3 &normal, OutputIterator out, const Kernel &K)
CGAL::Quadruple< OutputIterator, typename Kernel::FT, bool, bool >	surface_neighbor_coordinates_certified_3 (InputIterator first, InputIterator beyond, const typename Kernel::Point_3 &p, const typename Kernel::FT &max_distance, OutputIterator out, const Kernel &kernel)
CGAL::Quadruple< OutputIterator, typename ITraits::FT, bool, bool >	surface_neighbor_coordinates_certified_3 (InputIterator first, InputIterator beyond, const typename ITraits::Point_2 &p, OutputIterator out, const ITraits &traits)
CGAL::Quadruple< OutputIterator, typename ITraits::FT, bool, bool >	surface_neighbor_coordinates_certified_3 (InputIterator first, InputIterator beyond, const typename ITraits::Point_2 &p, const typename ITraits::FT &max_distance, OutputIterator out, const ITraits &traits)
CGAL::Triple< OutputIterator, typename Dt::Geom_traits::FT, bool >	surface_neighbor_coordinates_3 (const Dt &dt, const typename Dt::Geom_traits::Point_3 &p, const typename Dt::Geom_traits::Vector_3 &normal, OutputIterator out, typename Dt::Cell_handle start=typename Dt::Cell_handle())
CGAL::Triple< OutputIterator, typename Dt::Geom_traits::FT, bool >	surface_neighbor_coordinates_3 (const Dt &dt, const typename Dt::Geom_traits::Point_3 &p, OutputIterator out, const ITraits &traits, typename Dt::Cell_handle start=typename Dt::Cell_handle())
OutputIterator	surface_neighbors_3 (InputIterator first, InputIterator beyond, const typename Kernel::Point_3 &p, const typename Kernel::Vector_3 &normal, OutputIterator out, const Kernel &K)
OutputIterator	surface_neighbors_3 (InputIterator first, InputIterator beyond, const typename ITraits::Point_2 &p, OutputIterator out, const ITraits &traits)
std::pair< OutputIterator, bool >	surface_neighbors_certified_3 (InputIterator first, InputIterator beyond, const typename Kernel::Point_3 &p, const typename Kernel::Vector_3 &normal, OutputIterator out, const Kernel &K)
std::pair< OutputIterator, bool >	surface_neighbors_certified_3 (InputIterator first, InputIterator beyond, const typename Kernel::Point_3 &p, const typename Kernel::Vector_3 &normal, const typename Kernel::FT &max_distance, OutputIterator out, const Kernel &kernel)
std::pair< OutputIterator, bool >	surface_neighbors_certified_3 (InputIterator first, InputIterator beyond, const typename ITraits::Point_2 &p, OutputIterator out, const ITraits &traits)
std::pair< OutputIterator, bool >	surface_neighbors_certified_3 (InputIterator first, InputIterator beyond, const typename ITraits::Point_2 &p, const typename ITraits::FT &max_distance, OutputIterator out, const ITraits &traits)
OutputIterator	surface_neighbors_3 (const Dt &dt, const typename Dt::Geom_traits::Point_3 &p, const typename Dt::Geom_traits::Vector_3 &normal, OutputIterator out, typename Dt::Cell_handle start=typename Dt::Cell_handle())
OutputIterator	surface_neighbors_3 (const Dt &dt, const typename ITraits::Point_2 &p, OutputIterator out, const ITraits &traits, typename Dt::Cell_handle start=typename Dt::Cell_handle())
OutputIterator	copy_n (InputIterator first, Size n, OutputIterator result)
std::pair< ForwardIterator, ForwardIterator >	min_max_element (ForwardIterator first, ForwardIterator last)
std::pair< ForwardIterator, ForwardIterator >	min_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)
T	range_begin (Iterator_range< T > &x)
T	range_end (Iterator_range< T > &x)
T	range_begin (const Iterator_range< T > &x)
T	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)
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.0)
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	write_wrl (std::ostream &os, const FaceGraph &g, const NamedParameters &np)
bool	write_off (std::ostream &os, const FaceGraph &g, const NamedParameters &np)
bool	write_off (const char *fname, const FaceGraph &g, const NamedParameters &np)
bool	read_off (std::istream &is, FaceGraph &g, NamedParameters np)
bool	read_off (const char *fname, FaceGraph &g, NamedParameters np)
void	write_vtp (std::ostream &os, const TriangleMesh &mesh, 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)
Index_property_map< Iter >	make_index_property_map (Iter first, Iter beyond)
Pointer_property_map< T >::type	make_property_map (T *pointer)
Pointer_property_map< T >::type	make_property_map (std::vector< T > &v)
Pointer_property_map< T >::const_type	make_property_map (const T *pointer)
Pointer_property_map< T >::const_type	make_property_map (const std::vector< T > &v)
Boolean_property_map< Set >	make_boolean_property_map (Set &set_)
Cartesian_converter_property_map< GeomObject, Vpm >	make_cartesian_converter_property_map (Vpm vpm)
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	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 >)
OutputIterator	points_on_segment_2 (const P &p, const P &q, std::size_t n, OutputIterator o)
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 >)
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 >)
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 >)
OutputIterator	points_on_cube_grid_d (int dim, double a, std::size_t n, OutputIterator o, Creator creator)
Random &	get_default_random ()
void	random_convex_hull_in_disc_2 (std::size_t n, double radius, Generator &gen, OutputIterator it, const Traits &traits, bool fast=true)
OutputIterator	random_convex_set_2 (std::size_t n, OutputIterator o, const PointGenerator &pg, Traits t=Random_convex_set_traits_2)
OutputIterator	random_polygon_2 (std::size_t n, OutputIterator result, const PointGenerator &pg, Traits t=Default_traits)
OutputIterator	random_selection (RandomAccessIterator first, RandomAccessIterator last, Size n, OutputIterator result, Random &rnd=get_default_random())

Variables
	QP_CHOOSE_DEFAULT
	QP_PARTIAL_DANTZIG
	QP_DANTZIG
	QP_PARTIAL_FILTERED_DANTZIG
	QP_FILTERED_DANTZIG
	QP_BLAND
	QP_OPTIMAL
	QP_INFEASIBLE
	QP_UNBOUNDED
	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
	NORMAL
	THREADED
	POLAR
	BIPOLAR
	ARR_MIN_END
	ARR_MAX_END
	ARR_LEFT_TO_RIGHT
	ARR_RIGHT_TO_LEFT
const Arr_parameter_space	ARR_LEFT_BOUNDARY
const Arr_parameter_space	ARR_RIGHT_BOUNDARY
const Arr_parameter_space	ARR_BOTTOM_BOUNDARY
const Arr_parameter_space	ARR_TOP_BOUNDARY
const Arr_parameter_space	ARR_INTERIOR
	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
	Ridge_order_3
	Ridge_order_4
	MAX_ELLIPTIC_RIDGE
	MAX_HYPERBOLIC_RIDGE
	MAX_CREST_RIDGE
	MIN_ELLIPTIC_RIDGE
	MIN_HYPERBOLIC_RIDGE
	MIN_CREST_RIDGE
	NON_GENERIC_UMBILIC
	ELLIPTIC_UMBILIC
	HYPERBOLIC_UMBILIC
	ABORT
	EXIT
	EXIT_WITH_SUCCESS
	CONTINUE
	THROW_EXCEPTION
CGAL::Random	default_random