CGAL Namespace Reference

Namespaces
	cpp11
	cpp98
	IO
	parameters

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	Aff_transformation_2
class	Aff_transformation_3
class	Algebraic_structure_traits
struct	Ambient_dimension
class	Arr_accessor
class	Arr_algebraic_segment_traits_2
class	Arr_Bezier_curve_traits_2
class	Arr_bounded_planar_topology_traits_2
class	Arr_circle_segment_traits_2
class	Arr_circular_arc_traits_2
class	Arr_circular_line_arc_traits_2
struct	Arr_closed_side_tag
class	Arr_conic_traits_2
class	Arr_consolidated_curve_data_traits_2
struct	Arr_contracted_side_tag
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_geodesic_arc_on_sphere_traits_2
struct	Arr_identified_side_tag
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_spherical_topology_traits_2
class	Arr_text_formatter
class	Arr_trapezoid_ric_point_location
class	Arr_triangulation_point_location
class	Arr_unb_planar_topology_traits_2
class	Arr_vertex_index_map
class	Arr_walk_along_line_point_location
class	Arr_with_history_text_formatter
class	Arrangement_2
class	Arrangement_on_surface_2
class	Arrangement_on_surface_with_history_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_tag
struct	Cartesian
class	Cartesian_converter
struct	Cast_function_object
class	CC_safe_handle
class	Circle_2
class	Circle_3
struct	Circulator_base
class	Circulator_from_container
class	Circulator_from_iterator
struct	Circulator_tag
struct	Circulator_traits
struct	Coercion_traits
struct	Compact
class	Compact_container
class	Compact_container_base
struct	Compact_container_traits
class	Compare_to_less
class	Concurrent_compact_container
struct	Concurrent_compact_container_traits
class	Const_oneset_iterator
class	Constrained_Delaunay_triangulation_2
class	Constrained_triangulation_2
class	Constrained_triangulation_face_base_2
class	Constrained_triangulation_plus_2
struct	Construct_array
class	Container_from_circulator
class	Counting_iterator
class	Creator_1
class	Creator_2
class	Creator_3
class	Creator_4
class	Creator_5
class	Creator_uniform_2
class	Creator_uniform_3
class	Creator_uniform_4
class	Creator_uniform_5
class	Creator_uniform_6
class	Creator_uniform_7
class	Creator_uniform_8
class	Creator_uniform_9
class	Creator_uniform_d
struct	Default
class	Delaunay_triangulation_2
struct	Dereference
struct	Dimension_tag
class	Direction_2
class	Direction_3
class	Dispatch_or_drop_output_iterator
class	Dispatch_output_iterator
struct	Dynamic_dimension_tag
struct	Emptyset_iterator
struct	Euclidean_ring_tag
struct	Exact_intersections_tag
class	Exact_predicates_exact_constructions_kernel
class	Exact_predicates_exact_constructions_kernel_with_kth_root
class	Exact_predicates_exact_constructions_kernel_with_root_of
class	Exact_predicates_exact_constructions_kernel_with_sqrt
class	Exact_predicates_inexact_constructions_kernel
struct	Exact_predicates_tag
struct	Fast
struct	Feature_dimension
struct	Field_tag
struct	Field_with_kth_root_tag
struct	Field_with_root_of_tag
struct	Field_with_sqrt_tag
struct	Filter_iterator
struct	Filtered_kernel
struct	Filtered_kernel_adaptor
class	Filtered_predicate
struct	Forward_circulator_base
class	Forward_circulator_ptrbase
struct	Forward_circulator_tag
class	Fourtuple
class	Fraction_traits
class	General_polygon_2
class	General_polygon_set_2
class	General_polygon_with_holes_2
struct	Get_address
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
class	Greene_convex_decomposition_2
	The Greene_convex_decomposition_2 class implements the approximation algorithm of Greene for the decomposition of an input polygon into convex sub-polygons [6]. More...
class	Hertel_Mehlhorn_convex_decomposition_2
	The Hertel_Mehlhorn_convex_decomposition_2 class implements the approximation algorithm of Hertel and Mehlhorn for decomposing a polygon into convex sub-polygons [8]. More...
struct	Homogeneous
class	Homogeneous_converter
struct	Identity
class	Identity_transformation
class	In_place_list
class	In_place_list_base
class	Input_rep
class	Insert_iterator
struct	Integral_domain_tag
struct	Integral_domain_without_division_tag
class	Interval_nt
class	Inverse_index
class	Is_convex_2
class	Is_vacuously_valid
class	Is_valid
class	Is_y_monotone_2
class	Iso_cuboid_3
class	Iso_rectangle_2
class	Istream_iterator
class	Iterator_range
struct	Iterator_tag
class	Join_input_iterator_1
class	Join_input_iterator_2
class	Join_input_iterator_3
struct	Kernel_traits
class	Lazy_exact_nt
class	Line_2
class	Line_3
struct	Location_policy
struct	Max
struct	Min
class	MP_Float
struct	Mpzf
class	Multiset
class	N_step_adaptor
struct	No_constraint_intersection_requiring_constructions_tag
struct	No_constraint_intersection_tag
struct	No_intersection_tag
struct	NT_converter
struct	Null_functor
struct	Null_tag
class	Null_vector
class	Number_type_checker
class	Object
class	Oneset_iterator
class	Optimal_convex_decomposition_2
	The Optimal_convex_decomposition_2 class provides an implementation of Greene's dynamic programming algorithm for optimal decomposition of a polygon into convex sub-polygons [6]. More...
class	Origin
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	Plane_3
class	Point_2
class	Point_3
class	Polygon_2
class	Polygon_nop_decomposition_2
	The Polygon_nop_decomposition_2 class implements a convex decomposition of a polygon, which merely passes the input polygon to the list of output convex polygons. More...
class	Polygon_set_2
class	Polygon_triangulation_decomposition_2
	The Polygon_triangulation_decomposition_2 class implements a convex decomposition of a polygon or a polygon with holes into triangles using the Delaunay constrained triangulation functionality of the 2D Triangulation package. More...
class	Polygon_vertical_decomposition_2
	The Polygon_vertical_decomposition_2 class implements a convex decomposition of a polygon or a polygon with holes into pseudo trapezoids utilizing the CGAL::decompose() free function of the 2D Arrangements package. More...
class	Polygon_with_holes_2
struct	Project_facet
struct	Project_next
struct	Project_next_opposite
struct	Project_normal
struct	Project_opposite_prev
struct	Project_plane
struct	Project_point
struct	Project_prev
struct	Project_vertex
class	Projection_traits_3
class	Projection_traits_xy_3
class	Projection_traits_xz_3
class	Projection_traits_yz_3
struct	Protect_FPU_rounding
class	Quadruple
class	Quotient
class	Random_access_adaptor
struct	Random_access_circulator_base
class	Random_access_circulator_ptrbase
struct	Random_access_circulator_tag
class	Random_access_value_adaptor
class	Rational_traits
class	Ray_2
class	Ray_3
class	Real_embeddable_traits
class	Reflection
class	Regular_triangulation_2
class	Regular_triangulation_face_base_2
class	Regular_triangulation_vertex_base_2
struct	Root_of_traits
class	Rotation
class	Scaling
class	Segment_2
class	Segment_3
struct	Sequential_tag
class	Set_ieee_double_precision
struct	Simple_cartesian
struct	Simple_homogeneous
class	Sixtuple
class	Small_side_angle_bisector_decomposition_2
	The Small_side_angle_bisector_decomposition_2 class implements a simple yet efficient heuristic for decomposing an input polygon into convex sub-polygons. More...
class	Spatial_lock_grid_3
class	Sphere_3
class	Sqrt_extension
class	Tetrahedron_3
class	Threetuple
class	Translation
class	Triangle_2
class	Triangle_3
class	Triangulation_2
class	Triangulation_cw_ccw_2
class	Triangulation_face_base_2
class	Triangulation_face_base_with_info_2
class	Triangulation_hierarchy_2
class	Triangulation_hierarchy_vertex_base_2
class	Triangulation_vertex_base_2
class	Triangulation_vertex_base_with_info_2
class	Triple
class	Twotuple
class	Uncertain
struct	Unique_factorization_domain_tag
struct	value_type_traits
struct	value_type_traits< std::back_insert_iterator< Container > >
struct	value_type_traits< std::front_insert_iterator< Container > >
struct	value_type_traits< std::insert_iterator< Container > >
class	Vector_2
class	Vector_3
class	Verbose_ostream
class	Weighted_point_2
class	Weighted_point_3

Typedefs
typedef Sign	Orientation
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)
typedef Box_parameter_space_2	Arr_parameter_space
typedef Interval_nt< false >	Interval_nt_advanced
typedef unspecified_type	Exact_integer
typedef unspecified_type	Exact_rational

Enumerations
enum	Angle
enum	Bounded_side
enum	Comparison_result
enum	Sign
enum	Oriented_side
enum	Box_parameter_space_2
enum	Failure_behaviour
enum	Arr_curve_end
enum	Arr_halfedge_direction

Functions
std::string	data_file_path (const std::string &filename)
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)
decltype(auto)	intersection (Type1< Kernel > obj1, Type2< Kernel > obj2)
decltype(auto)	intersection (const Plane_3< Kernel > &pl1, const Plane_3< Kernel > &pl2, const Plane_3< Kernel > &pl3)
Angle	angle (const CGAL::Vector_2< Kernel > &u, const CGAL::Vector_2< Kernel > &v)
Angle	angle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
Angle	angle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s)
Angle	angle (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v)
Angle	angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
Angle	angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
Angle	angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Vector_3< Kernel > &v)
Kernel::FT	approximate_angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
Kernel::FT	approximate_angle (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v)
Kernel::FT	approximate_dihedral_angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
Kernel::FT	area (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
bool	are_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
bool	are_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
bool	are_strictly_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
bool	are_strictly_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
CGAL::Point_2< 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_angle (const CGAL::Point_3< Kernel > &a, const CGAL::Point_3< Kernel > &b, const CGAL::Point_3< Kernel > &c, 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 Kernel::FT &cosine)
Comparison_result	compare_dihedral_angle (const CGAL::Point_3< Kernel > &a1, const CGAL::Point_3< Kernel > &b1, const CGAL::Point_3< Kernel > &c1, const CGAL::Point_3< Kernel > &d1, const CGAL::Point_3< Kernel > &a2, const CGAL::Point_3< Kernel > &b2, const CGAL::Point_3< Kernel > &c2, const CGAL::Point_3< Kernel > &d2)
Comparison_result	compare_dihedral_angle (const CGAL::Vector_3< Kernel > &u1, const CGAL::Vector_3< Kernel > &v1, const CGAL::Vector_3< Kernel > &w1, const Kernel::FT &cosine)
Comparison_result	compare_dihedral_angle (const CGAL::Vector_3< Kernel > &u1, const CGAL::Vector_3< Kernel > &v1, const CGAL::Vector_3< Kernel > &w1, const CGAL::Vector_3< Kernel > &u2, const CGAL::Vector_3< Kernel > &v2, const CGAL::Vector_3< Kernel > &w2)
Comparison_result	compare_distance_to_point (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r)
Comparison_result	compare_distance_to_point (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
Comparison_result	compare_lexicographically (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
Comparison_result	compare_lexicographically (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
Comparison_result	compare_signed_distance_to_line (const CGAL::Line_2< Kernel > &l, const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
Comparison_result	compare_signed_distance_to_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s)
Comparison_result	compare_signed_distance_to_plane (const CGAL::Plane_3< Kernel > &h, const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
Comparison_result	compare_signed_distance_to_plane (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &t)
Comparison_result	compare_slope (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2)
Comparison_result	compare_slope (const CGAL::Segment_2< Kernel > &s1, const CGAL::Segment_2< Kernel > &s2)
Comparison_result	compare_slope (const CGAL::Point_2< Kernel > &s1s, const CGAL::Point_2< Kernel > &s1t, const CGAL::Point_2< Kernel > &s2s, const CGAL::Point_2< Kernel > &s2t)
Comparison_result	compare_slope (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
Comparison_result	compare_squared_distance (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const typename Kernel::FT &d2)
Comparison_result	compare_squared_distance (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const typename Kernel::FT &d2)
Comparison_result	compare_squared_radius (const CGAL::Point_3< Kernel > &p, const typename Kernel::FT &sr)
Comparison_result	compare_squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const typename Kernel::FT &sr)
Comparison_result	compare_squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const typename Kernel::FT &sr)
Comparison_result	compare_squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const typename Kernel::FT &sr)
Comparison_result	compare_x (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
Comparison_result	compare_x (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
Comparison_result	compare_x (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2)
Comparison_result	compare_x (const CGAL::Line_2< Kernel > &l, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
Comparison_result	compare_x (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
Comparison_result	compare_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_point_2< CircularKernel > &q)
Comparison_result	compare_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Point_2< CircularKernel > &q)
Comparison_result	compare_x (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
Comparison_result	compare_x (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
Comparison_result	compare_xy (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
Comparison_result	compare_xy (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
Comparison_result	compare_xy (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_point_2< CircularKernel > &q)
Comparison_result	compare_xy (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Point_2< CircularKernel > &q)
Comparison_result	compare_xy (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
Comparison_result	compare_xy (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
Comparison_result	compare_x_at_y (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h)
Comparison_result	compare_x_at_y (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
Comparison_result	compare_x_at_y (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h)
Comparison_result	compare_x_at_y (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
Comparison_result	compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h)
Comparison_result	compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
Comparison_result	compare_y_at_x (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h)
Comparison_result	compare_y_at_x (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
Comparison_result	compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Segment_2< Kernel > &s)
Comparison_result	compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Segment_2< Kernel > &s1, const CGAL::Segment_2< Kernel > &s2)
Comparison_result	compare_y (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
Comparison_result	compare_y (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
Comparison_result	compare_y (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2)
Comparison_result	compare_y (const CGAL::Line_2< Kernel > &l, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
Comparison_result	compare_y (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2)
Comparison_result	compare_y (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_point_2< CircularKernel > &q)
Comparison_result	compare_y (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Point_2< CircularKernel > &q)
Comparison_result	compare_y (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
Comparison_result	compare_y (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
Comparison_result	compare_xyz (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
Comparison_result	compare_xyz (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
Comparison_result	compare_xyz (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
Comparison_result	compare_z (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
Comparison_result	compare_z (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q)
Comparison_result	compare_z (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q)
Comparison_result	compare_yx (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
bool	coplanar (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
Orientation	coplanar_orientation (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
Orientation	coplanar_orientation (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r)
Bounded_side	coplanar_side_of_bounded_circle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s)
CGAL::Vector_3< 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_2< Kernel >	midpoint (const CGAL::Segment_2< Kernel > &s)
CGAL::Point_3< Kernel >	midpoint (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q)
CGAL::Point_3< Kernel >	midpoint (const CGAL::Segment_3< Kernel > &s)
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)
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)
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)
NT	abs (const NT &x)
result_type	compare (const NT &x, const NT &y)
result_type	div (const NT1 &x, const NT2 &y)
void	div_mod (const NT1 &x, const NT2 &y, result_type &q, result_type &r)
result_type	gcd (const NT1 &x, const NT2 &y)
result_type	integral_division (const NT1 &x, const NT2 &y)
NT	inverse (const NT &x)
result_type	is_negative (const NT &x)
result_type	is_one (const NT &x)
result_type	is_positive (const NT &x)
result_type	is_square (const NT &x)
result_type	is_square (const NT &x, NT &y)
result_type	is_zero (const NT &x)
NT	kth_root (int k, const NT &x)
result_type	mod (const NT1 &x, const NT2 &y)
NT	root_of (int k, InputIterator begin, InputIterator end)
result_type	sign (const NT &x)
void	simplify (const NT &x)
NT	sqrt (const NT &x)
NT	square (const NT &x)
double	to_double (const NT &x)
std::pair< double, double >	to_interval (const NT &x)
NT	unit_part (const NT &x)
void	Assert_circulator (const C &c)
void	Assert_iterator (const I &i)
void	Assert_circulator_or_iterator (const IC &i)
void	Assert_input_category (const I &i)
void	Assert_output_category (const I &i)
void	Assert_forward_category (const IC &ic)
void	Assert_bidirectional_category (const IC &ic)
void	Assert_random_access_category (const IC &ic)
C::difference_type	circulator_distance (C c, C d)
C::size_type	circulator_size (C c)
bool	is_empty_range (const IC &i, const IC &j)
iterator_traits< IC >::difference_type	iterator_distance (IC ic1, IC ic2)
Iterator_tag	query_circulator_or_iterator (const I &i)
Circulator_tag	query_circulator_or_iterator (const C &c)
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)
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_2< Traits, Dcel > &arr, const typename Traits::X_monotone_curve_2 &c, OutputIterator oi, const PointLocation &pl)
bool	do_intersect (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, const Curve &c, const PointLocation &pl)
Arrangement_on_surface_2< GeometryTraits, TopologyTraits >::Halfedge_handle	insert_non_intersecting_curve (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, const typename Traits::X_monotone_curve_2 &xc, const PointLocation &pl=walk_pl)
void	insert_non_intersecting_curves (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, InputIterator first, InputIterator last)
Arrangement_on_surface_2< GeometryTraits, TopologyTraits >::Vertex_handle	insert_point (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, const typename Traits::Point_2 &p, const PointLocation &pl=walk_pl)
bool	is_valid (const Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr)
Arrangement_on_surface_2< GeometryTraits, TopologyTraits >::Face_handle	remove_edge (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, typename Arrangement_on_surface_2< GeometryTraits, TopologyTraits >::Halfedge_handle e)
bool	remove_vertex (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, typename Arrangement_on_surface_2< GeometryTraits, TopologyTraits >::Vertex_handle v)
OutputIterator	zone (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, const typename GeometryTraits::X_monotone_curve_2 &c, OutputIterator oi, const PointLocation &pl)
Arrangement_on_surface_with_history_2< GeometryTraits, TopologyTraits >::Curve_handle	insert (Arrangement_on_surface_with_history_2< GeometryTraits, TopologyTraits > &arr, const typename Traits::Curve_2 &c, const PointLocation &pl=walk_pl)
void	insert (Arrangement_on_surface_with_history_2< GeometryTraits, TopologyTraits > &arr, InputIterator first, InputIterator last)
Size	remove_curve (Arrangement_on_surface_with_history_2< GeometryTraits, TopologyTraits > &arr, typename Arrangement_on_surface_with_history_2< GeometryTraits, TopologyTraits >::Curve_handle ch)
void	overlay (const Arrangement_on_surface_with_history_2< GeometryTraits, TopologyTraits1 > &arr1, const Arrangement_on_surface_with_history_2< GeometryTraits, TopologyTraits12 > &arr2, Arrangement_on_surface_with_history_2< GeometryTraits, ResTopologyTraits > &res, OverlayTraits &ovl_tr)
void	overlay (const Arrangement_on_surface_with_history_2< GeometryTraits, TopologyTraits1 > &arr1, const Arrangement_on_surface_with_history_2< GeometryTraits, TopologyTraits2 > &arr2, Arrangement_on_surface_with_history_2< GeometryTraits, ResTopologyTraits > &res)
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)
void	draw (const Arrangement_2< GeometryTraits_2, Dcel > &arr, const char *title="2D Arrangement Basic Viewer")
std::ostream &	operator<< (std::ostream &os, const Arrangement_2< Traits, Dcel > &arr)
std::istream &	operator>> (std::istream &is, Arrangement_2< Traits, Dcel > &arr)
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, typename Arr_point_location_result< Arrangement_2< Traits, Dcel > >::type obj)
void	insert (Arrangement_2< Traits, Dcel > &arr, InputIterator first, InputIterator last)
void	insert (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, const Curve &c, const PointLocation &pl=walk_pl)
void	insert (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, const typename Traits::X_monotone_curve_2 &xc, typename Arr_point_location_result< Arrangement_on_surface_2< GeometryTraits, TopologyTraits > >::type obj)
void	insert (Arrangement_on_surface_2< GeometryTraits, TopologyTraits > &arr, InputIterator first, InputIterator last)
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)
void	complement (const Polygon_2< Kernel, Container > &pgn, Polygon_with_holes_2< Kernel, Container > &res)
void	complement (const Polygon_2< Kernel, Container > &pgn, Polygon_with_holes_2< Kernel, Container > &res, UsePolylines=Tag_true())
void	complement (const General_polygon_2< ArrTraits > &pgn, General_polygon_with_holes_2< General_polygon_2< Arr_traits >> &res)
OutputIterator	complement (const Polygon_with_holes_2< Kernel, Container > &pgn, OutputIterator oi)
OutputIterator	complement (const Polygon_with_holes_2< Kernel, Container > &pgn, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	complement (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn, OutputIterator oi)
void	complement (const Polygon_2< Kernel, Container > &pgn, Polygon_with_holes_2< Kernel, Container > &res, const GpsTraits &traits)
void	complement (const General_polygon_2< ArrTraits > &pgn, General_polygon_with_holes_2< General_polygon_2< Arr_traits >> &res, const GpsTraits &traits)
OutputIterator	complement (const Polygon_with_holes_2< Kernel, Container > &pgn, OutputIterator oi, const GpsTraits &traits)
OutputIterator	complement (const General_polygon_with_holes_2< Polygon > &pgn, OutputIterator oi, const GpsTraits &traits)
OutputIterator	difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	difference (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi)
OutputIterator	difference (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi)
OutputIterator	difference (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, OutputIterator oi)
OutputIterator	difference (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, OutputIterator oi)
OutputIterator	difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	difference (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	difference (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	difference (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	difference (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, OutputIterator oi, const GpsTraits &traits)
bool	do_intersect (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2)
bool	do_intersect (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, UsePolylines=Tag_true())
bool	do_intersect (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2)
bool	do_intersect (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, UsePolylines=Tag_true())
bool	do_intersect (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2)
bool	do_intersect (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, UsePolylines=Tag_true())
bool	do_intersect (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2)
bool	do_intersect (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, UsePolylines=Tag_true())
bool	do_intersect (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2)
bool	do_intersect (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2)
bool	do_intersect (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2)
bool	do_intersect (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2)
bool	do_intersect (InputIterator begin, InputIterator end)
bool	do_intersect (InputIterator begin, InputIterator end, UsePolylines=Tag_true())
bool	do_intersect (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2)
bool	do_intersect (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, UsePolylines=Tag_true())
bool	do_intersect (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, const GpsTraits &traits)
bool	do_intersect (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, const GpsTraits &traits, const GpsTraits &traits)
bool	do_intersect (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, const GpsTraits &traits)
bool	do_intersect (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, const GpsTraits &traits)
bool	do_intersect (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, const GpsTraits &traits)
bool	do_intersect (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, const GpsTraits &traits)
bool	do_intersect (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2, const GpsTraits &traits)
bool	do_intersect (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, const GpsTraits &traits)
bool	do_intersect (InputIterator begin, InputIterator end, const GpsTraits &traits)
bool	do_intersect (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, const GpsTraits &traits)
OutputIterator	intersection (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	intersection (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	intersection (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	intersection (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	intersection (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	intersection (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	intersection (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	intersection (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	intersection (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi)
OutputIterator	intersection (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi)
OutputIterator	intersection (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, OutputIterator oi)
OutputIterator	intersection (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, OutputIterator oi)
OutputIterator	intersection (InputIterator begin, InputIterator end, OutputIterator oi)
OutputIterator	intersection (InputIterator begin, InputIterator end, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	intersection (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi)
OutputIterator	intersection (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	intersection (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	intersection (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	intersection (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	intersection (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	intersection (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	intersection (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	intersection (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	intersection (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	intersection (InputIterator begin, InputIterator end, OutputIterator oi, const GpsTraits &traits)
OutputIterator	intersection (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, const GpsTraits &traits)
bool	join (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res)
bool	join (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res, UsePolylines=Tag_true())
bool	join (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res)
bool	join (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res, UsePolylines=Tag_true())
bool	join (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res)
bool	join (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res, UsePolylines=Tag_true())
bool	join (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res)
bool	join (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res, UsePolylines=Tag_true())
bool	join (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &res)
bool	join (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &res)
bool	join (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, const General_polygon_2< ArrTraits > &pgn1, General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &res)
bool	join (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, General_polygon_with_holes_2< Polygon > &res)
OutputIterator	join (InputIterator begin, InputIterator end, OutputIterator oi)
OutputIterator	join (InputIterator begin, InputIterator end, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	join (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi)
bool	join (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res, const GpsTraits &traits)
bool	join (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res, const GpsTraits &traits)
bool	join (const Polygon_with_holes_2< Kernel, Container > &pgn2, const Polygon_2< Kernel, Container > &pgn1, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res, const GpsTraits &traits)
bool	join (const Polygon_with_holes_2< Kernel, Container > &pgn2, const Polygon_with_holes_2< Kernel, Container > &pgn1, General_polygon_with_holes_2< Polygon_2< Kernel, Container >> &res, const GpsTraits &traits)
bool	join (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &res, const GpsTraits &traits)
bool	join (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &res, const GpsTraits &traits)
bool	join (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, const General_polygon_2< ArrTraits > &pgn1, General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &res, const GpsTraits &traits)
bool	join (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, General_polygon_with_holes_2< Polygon > &res, const GpsTraits &traits)
OutputIterator	join (InputIterator begin, InputIterator end, OutputIterator oi, const GpsTraits &traits)
OutputIterator	join (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	join (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, UsePolylines=Tag_true())
Oriented_side	oriented_side (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2)
Oriented_side	oriented_side (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, UsePolylines=Tag_true())
Oriented_side	oriented_side (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2)
Oriented_side	oriented_side (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, UsePolylines=Tag_true())
Oriented_side	oriented_side (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2)
Oriented_side	oriented_side (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, UsePolylines=Tag_true())
Oriented_side	oriented_side (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2)
Oriented_side	oriented_side (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, UsePolylines=Tag_true())
Oriented_side	oriented_side (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2)
Oriented_side	oriented_side (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2)
Oriented_side	oriented_side (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2)
Oriented_side	oriented_side (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2)
Oriented_side	oriented_side (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, const GpsTraits &traits)
Oriented_side	oriented_side (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, const GpsTraits &traits)
Oriented_side	oriented_side (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, const GpsTraits &traits)
Oriented_side	oriented_side (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, const GpsTraits &traits)
Oriented_side	oriented_side (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, const GpsTraits &traits)
Oriented_side	oriented_side (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, const GpsTraits &traits)
Oriented_side	oriented_side (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2, const GpsTraits &traits)
Oriented_side	oriented_side (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, const GpsTraits &traits)
Oriented_side	oriented_side (const Point_2 &p, const Polygon_2< Kernel, Container > &pgn)
Oriented_side	oriented_side (const Point_2 &p, const Polygon_with_holes_2< Kernel, Container > &pgn)
Oriented_side	oriented_side (const Point_2 &p, const General_polygon_2< ArrTraits > &pgn)
Oriented_side	oriented_side (const Point_2 &p, const General_polygon_with_holes_2< Polygon > &pgn)
Oriented_side	oriented_side (const Point_2 &p, const Polygon_2< Kernel, Container > &pgn, const GpsTraits &traits)
Oriented_side	oriented_side (const Point_2 &p, const Polygon_with_holes_2< Kernel, Container > &pgn, const GpsTraits &traits)
Oriented_side	oriented_side (const Point_2 &p, const General_polygon_2< ArrTraits > &pgn, const GpsTraits &traits)
Oriented_side	oriented_side (const Point_2 &p, const General_polygon_with_holes_2< Polygon > &pgn, const GpsTraits &traits)
OutputIterator	symmetric_difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	symmetric_difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	symmetric_difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	symmetric_difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi)
OutputIterator	symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	symmetric_difference (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi)
OutputIterator	symmetric_difference (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi)
OutputIterator	symmetric_difference (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, OutputIterator oi)
OutputIterator	symmetric_difference (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, OutputIterator oi)
OutputIterator	symmetric_difference (InputIterator begin, InputIterator end, OutputIterator oi)
OutputIterator	symmetric_difference (InputIterator begin, InputIterator end, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	symmetric_difference (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi)
OutputIterator	symmetric_difference (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, UsePolylines=Tag_true())
OutputIterator	symmetric_difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	symmetric_difference (const Polygon_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	symmetric_difference (const Polygon_with_holes_2< Kernel, Container > &pgn1, const Polygon_with_holes_2< Kernel, Container > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	symmetric_difference (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	symmetric_difference (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn1, const General_polygon_2< ArrTraits > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	symmetric_difference (const General_polygon_2< ArrTraits > &pgn1, const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	symmetric_difference (const General_polygon_with_holes_2< Polygon > &pgn1, const General_polygon_with_holes_2< Polygon > &pgn2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	symmetric_difference (InputIterator begin, InputIterator end, OutputIterator oi, const GpsTraits &traits)
OutputIterator	symmetric_difference (InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, InputIterator2 end2, OutputIterator oi, const GpsTraits &traits)
OutputIterator	connect_holes (const Polygon_with_holes_2< Kernel, Container > &pwh, OutputIterator oi)
void	draw (const PS &aps)
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)
void	draw (const T2 &at2)
void	draw (const CT2 &act2, InDomainPMap ipm)
void	mark_domain_in_triangulation (CT &ct, InDomainPmap ipm)
void	mark_domain_in_triangulation (CT &ct)
template<class Kernel , class Container , class OutputIterator >
OutputIterator	approximated_inset_2 (const Polygon_2< Kernel, Container > &pgn, const typename Kernel::FT &r, const double &eps, OutputIterator oi)
	Provides a guaranteed approximation of the inset, or inner offset, of the given polygon P by a given radius r. More...
template<class Kernel , class Container >
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)
	Provides a guaranteed approximation of the offset of the given polygon P by a given radius r - namely, the function computes the Minkowski sum \( P \oplus B_r\), where \( B_r\) is a disc of radius r centered at the origin. More...
template<class Kernel , class Container >
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)
	Provides a guaranteed approximation of offset the given polygon with holes pwh by a given radius r, such that the approximation error is bounded by eps. More...
template<class Kernel , class Container , class DecompositionStrategy >
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)
	Provides a guaranteed approximation of the offset of the given polygon P by a radius r, as described above. More...
template<typename Kernel , typename Container >
Polygon_with_holes_2< Kernel, Container >	minkowski_sum_2 (const PolygonType1< Kernel, Container > &P, const PolygonType2< Kernel, Container > &Q)
	Computes the Minkowski sum \( P \oplus Q\) of two given polygons (which may have holes). More...
template<typename Kernel , typename Container >
Polygon_with_holes_2< Kernel, Container >	minkowski_sum_by_reduced_convolution_2 (const PolygonType1< Kernel, Container > &P, const PolygonType2< Kernel, Container > &Q)
	Computes the Minkowski sum \( P \oplus Q\) of the two given polygons. More...
template<typename Kernel , typename Container >
Polygon_with_holes_2< Kernel, Container >	minkowski_sum_by_full_convolution_2 (const Polygon_2< Kernel, Container > &P, const Polygon_2< Kernel, Container > &Q)
	Computes the Minkowski sum \( P \oplus Q\) of the two given polygons. More...
template<typename Kernel , typename Container , typename PolygonConvexDecompositionP_2_ , typename PolygonConvexDecompositionQ_2_ >
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 >())
	Computes the Minkowski sum \( P \oplus Q\) of the two given polygons. More...
template<typename Kernel , typename Container , typename PolygonConvexDecomposition_2_ >
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 >())
	Computes the Minkowski sum \( P \oplus Q\) of the two given polygons. More...
template<typename Kernel , typename Container , typename PolygonNoHolesConvexDecomposition_2_ , typename PolygonWithHolesConvexDecomposition_2_ >
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 >())
	Computes the Minkowski sum \( P \oplus Q\) of the two given polygons using the decomposition strategy. More...
template<class ConicTraits , class Container , class OutputIterator >
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)
	Computes the inset, or inner offset, of the given polygon P by a given radius r - namely, the function computes the set of points inside the polygon whose distance from \( P\)'s boundary is at least \( r\): \( \{ p \in P \;|\; {\rm dist}(p, \partial P) \geq r \}\). More...
template<class ConicTraits , class Container >
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)
	Computes the offset of the given polygon P by a given radius r - namely, the function computes the Minkowski sum \( P \oplus B_r\), where \( B_r\) is a disc of radius r centered at the origin. More...
template<class ConicTraits , class Container >
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)
	Computes the offset of the given polygon with holes pwh by a given radius r. More...
template<class ConicTraits , class Container , class DecompositionStrategy >
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)
	Computes the exact representation of the offset of the given polygon P by a radius r, as described above. More...

Variables
	OBTUSE
	RIGHT
	ACUTE
	ON_UNBOUNDED_SIDE
	ON_BOUNDARY
	ON_BOUNDED_SIDE
	SMALLER
	EQUAL
	LARGER
	NEGATIVE
	ZERO
	POSITIVE
	ON_NEGATIVE_SIDE
	ON_ORIENTED_BOUNDARY
	ON_POSITIVE_SIDE
	LEFT_BOUNDARY
	RIGHT_BOUNDARY
	BOTTOM_BOUNDARY
	TOP_BOUNDARY
	INTERIOR
	EXTERIOR
const CGAL::Orientation	CLOCKWISE
const CGAL::Orientation	COUNTERCLOCKWISE
const CGAL::Orientation	COLLINEAR
const CGAL::Orientation	LEFT_TURN
const CGAL::Orientation	RIGHT_TURN
const CGAL::Orientation	COPLANAR
const CGAL::Orientation	DEGENERATE
const CGAL::Null_vector	NULL_VECTOR
const CGAL::Origin	ORIGIN
	ABORT
	EXIT
	EXIT_WITH_SUCCESS
	CONTINUE
	THROW_EXCEPTION
	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
class CGAL::Arr_naive_point_location	trim_2_object