|
class | Aff_transformation_2 |
|
class | Aff_transformation_3 |
|
struct | Ambient_dimension |
|
class | Bbox_2 |
|
class | Bbox_3 |
|
struct | Bidirectional_circulator_base |
|
class | Bidirectional_circulator_ptrbase |
|
struct | Bidirectional_circulator_tag |
|
struct | Boolean_tag |
| Depending on bool value the class Boolean_tag indicates that something is true or false respectively. More...
|
|
struct | Cartesian |
|
class | Cartesian_converter |
|
struct | Cast_function_object |
| The class Cast_function_object applies a C-style type cast to its argument. More...
|
|
class | CC_safe_handle |
| The class CC_safe_handle is a helper class that stores an iterator on a Compact_container (or Concurrent_compact_container ) and is able to know if the pointee has been erased after the creation of the CC_safe_handle instance. More...
|
|
class | Circle_2 |
|
class | Circle_3 |
|
struct | Circulator_base |
|
class | Circulator_from_container |
|
class | Circulator_from_iterator |
|
struct | Circulator_tag |
|
struct | Circulator_traits |
|
struct | Compact |
| Compact is a tag class. More...
|
|
class | Compact_container |
| An object of the class Compact_container is a container of objects of type T . More...
|
|
class | Compact_container_base |
| The class Compact_container_base can be used as a base class for your own type T , so that T can be used directly within Compact_container<T, Allocator> . More...
|
|
struct | Compact_container_traits |
| The traits class Compact_container_traits provides the way to access the internal pointer required for T to be used in a Compact_container<T, Allocator> . More...
|
|
class | Compare_to_less |
| The class Compare_to_less is used to convert a functor which returns a Comparison_result to a predicate (returning bool) : it will return true iff the return value of F is SMALLER . More...
|
|
class | Concurrent_compact_container |
| An object of the class Concurrent_compact_container is a container of objects of type T , which allows to call insert and erase operations concurrently. More...
|
|
struct | Concurrent_compact_container_traits |
| The traits class Concurrent_compact_container_traits provides the way to access the internal pointer required for T to be used in a Concurrent_compact_container<T, Allocator> . More...
|
|
class | Const_oneset_iterator |
| The class Const_oneset_iterator defines a RandomAccessIterator that always refers to a copy of a specific object of type T . More...
|
|
struct | Construct_array |
| Functor that constructs std::array<T, N> where N is the number of arguments given to the function. More...
|
|
class | Container_from_circulator |
|
class | Counting_iterator |
| The iterator adaptor Counting_iterator adds a counter to the internal iterator of type Iterator and defines equality of two instances in terms of this counter. More...
|
|
class | Creator_1 |
| The class Creator_1 defines types and operations for creating objects from one argument. More...
|
|
class | Creator_2 |
| The class Creator_2 defines types and operations for creating objects from two arguments. More...
|
|
class | Creator_3 |
| The class Creator_3 defines types and operations for creating objects from three arguments. More...
|
|
class | Creator_4 |
| The class Creator_4 defines types and operations for creating objects from four arguments. More...
|
|
class | Creator_5 |
| The class Creator_5 defines types and operations for creating objects from five arguments. More...
|
|
class | Creator_uniform_2 |
| The class Creator_uniform_2 defines types and operations for creating objects from two arguments of the same type. More...
|
|
class | Creator_uniform_3 |
| The class Creator_uniform_3 defines types and operations for creating objects from three arguments of the same type. More...
|
|
class | Creator_uniform_4 |
| The class Creator_uniform_4 defines types and operations for creating objects from four arguments of the same type. More...
|
|
class | Creator_uniform_5 |
| The class Creator_uniform_5 defines types and operations for creating objects from five arguments of the same type. More...
|
|
class | Creator_uniform_6 |
| The class Creator_uniform_6 defines types and operations for creating objects from six arguments of the same type. More...
|
|
class | Creator_uniform_7 |
| The class Creator_uniform_7 defines types and operations for creating objects from seven arguments of the same type. More...
|
|
class | Creator_uniform_8 |
| The class Creator_uniform_8 defines types and operations for creating objects from eight arguments of the same type. More...
|
|
class | Creator_uniform_9 |
| The class Creator_uniform_9 defines types and operations for creating objects from nine arguments of the same type. More...
|
|
class | Creator_uniform_d |
| The class Creator_uniform_d defines types and operations for creating objects from two arguments of the same type. More...
|
|
struct | Default |
| Default is a tag class. More...
|
|
struct | Dereference |
| The class Dereference dereferences a pointer (operator* ). More...
|
|
struct | Dimension_tag |
|
class | Direction_2 |
|
class | Direction_3 |
|
class | Dispatch_or_drop_output_iterator |
| The class Dispatch_or_drop_output_iterator defines an OutputIterator that contains a tuple of output iterators, and dispatches among those based on the type of the value type which is put in it. More...
|
|
class | Dispatch_output_iterator |
| The class Dispatch_output_iterator defines an OutputIterator that contains a tuple of output iterators, and dispatches among those based on the type of the value type which is put in it. More...
|
|
class | Dual |
|
struct | Dynamic_dimension_tag |
|
struct | dynamic_edge_property_t |
|
struct | dynamic_face_property_t |
|
struct | dynamic_halfedge_property_t |
|
struct | dynamic_vertex_property_t |
|
struct | Emptyset_iterator |
| The class Emptyset_iterator defines an OutputIterator that ignores everything written to it. More...
|
|
class | Exact_predicates_exact_constructions_kernel |
|
class | Exact_predicates_exact_constructions_kernel_with_kth_root |
|
class | Exact_predicates_exact_constructions_kernel_with_root_of |
|
class | Exact_predicates_exact_constructions_kernel_with_sqrt |
|
class | Exact_predicates_inexact_constructions_kernel |
|
class | Face_around_face_circulator |
|
class | Face_around_face_iterator |
|
class | Face_around_target_circulator |
|
class | Face_around_target_iterator |
|
struct | Face_filtered_graph |
|
struct | Fast |
| Fast is a tag class. More...
|
|
struct | Feature_dimension |
|
struct | Filter_iterator |
| The iterator adaptor Filter_iterator acts as a filter on a given range. More...
|
|
struct | Filtered_kernel |
|
struct | Filtered_kernel_adaptor |
|
class | Filtered_predicate |
|
struct | Forward_circulator_base |
|
class | Forward_circulator_ptrbase |
|
struct | Forward_circulator_tag |
|
class | Fourtuple |
| The Fourtuple class stores a homogeneous (same type) fourtuple of objects of type T . More...
|
|
struct | Get_address |
| The class Get_address gets the address of an lvalue (operator& ). More...
|
|
class | Gmpfi |
|
class | Gmpfr |
|
class | Gmpq |
|
class | Gmpz |
|
class | Gmpzf |
|
struct | graph_has_property |
|
struct | Graph_with_descriptor_with_graph |
|
struct | Graph_with_descriptor_with_graph_property_map |
|
class | Halfedge_around_face_circulator |
|
class | Halfedge_around_face_iterator |
|
class | Halfedge_around_source_circulator |
|
class | Halfedge_around_source_iterator |
|
class | Halfedge_around_target_circulator |
|
class | Halfedge_around_target_iterator |
|
class | HalfedgeDS_face_max_base_with_id |
|
class | HalfedgeDS_halfedge_max_base_with_id |
|
class | HalfedgeDS_vertex_max_base_with_id |
|
struct | Handle_hash_function |
|
struct | Homogeneous |
|
class | Homogeneous_converter |
|
struct | Identity |
| The class Identity represents the identity function on Value . More...
|
|
class | Identity_transformation |
|
class | In_place_list |
| An object of the class In_place_list represents a sequence of items of type T that supports bidirectional iterators and allows constant time insert and erase operations anywhere within the sequence. More...
|
|
class | In_place_list_base |
| The node base classes provides pointers to build linked lists. More...
|
|
class | Insert_iterator |
| The output iterator Insert_iterator is similar to std::insert_iterator , but differs in that it calls the insert() function of the container without the iterator additional argument. More...
|
|
class | Interval_nt |
|
class | Inverse_index |
| The class Inverse_index constructs an inverse index for a given range [i,j) of two iterators or circulators of type IC . More...
|
|
class | Is_valid |
|
class | Iso_cuboid_3 |
|
class | Iso_rectangle_2 |
|
class | Iterator_range |
| CGAL::Iterator_range encapsulates two iterators so they fulfill the ForwardRange concept. More...
|
|
struct | Iterator_tag |
|
class | Join_input_iterator_1 |
| The class Join_input_iterator_1 joins an iterator and a creator function object. More...
|
|
class | Join_input_iterator_2 |
| The class Join_input_iterator_2 joins two iterators. More...
|
|
class | Join_input_iterator_3 |
| The class Join_input_iterator_3 joins three iterators. More...
|
|
struct | Kernel_traits |
|
class | Lazy_exact_nt |
|
class | Line_2 |
|
class | Line_3 |
|
struct | Linear_cell_complex_bgl_min_items |
|
struct | Linear_cell_complex_for_bgl_combinatorial_map_helper |
|
struct | Location_policy |
| Location_policy is a policy class which can be used to specify a trade-off between memory usage and time complexity for the point location strategy used in a data-structure. More...
|
|
struct | Max |
|
struct | Memory_sizer |
|
struct | Min |
|
class | Modifier_base |
|
class | MP_Float |
|
struct | Mpzf |
|
class | Multiset |
|
class | N_step_adaptor |
| The adaptor N_step_adaptor changes the step width of the iterator or circulator class I to N . More...
|
|
struct | NT_converter |
|
struct | Null_functor |
| Class indicating the absence of a functor. More...
|
|
struct | Null_tag |
| General tag indicating that non of any other possible tags is valid. More...
|
|
class | Null_vector |
|
class | Number_type_checker |
|
class | Object |
| Some functions can return different types of objects. More...
|
|
class | Oneset_iterator |
| The class Oneset_iterator defines an BidirectionalIterator that always refers to one specific object of type T . More...
|
|
class | Origin |
|
struct | Parallel_if_available_tag |
| This tag is a convenience typedef to Parallel_tag if the third party library Intel TBB has been found and linked, and to Sequential_tag otherwise. More...
|
|
struct | Parallel_tag |
| Tag used to enable concurrency. More...
|
|
class | Plane_3 |
|
class | Point_2 |
|
class | Point_3 |
|
class | Polyhedron_items_with_id_3 |
|
struct | Profile_counter |
|
struct | Project_facet |
| The class Project_facet calls the member function facet() on an instance of type Node . More...
|
|
struct | Project_next |
| The class Project_next calls the member function next() on an instance of type Node . More...
|
|
struct | Project_next_opposite |
| The class Project_next_opposite calls the member functions next()->opposite() on an instance of type Node . More...
|
|
struct | Project_normal |
| The class Project_normal calls the member function normal() on an instance of type Node . More...
|
|
struct | Project_opposite_prev |
| The class Project_opposite_prev calls the member functions opposite()->prev() on an instance of type Node . More...
|
|
struct | Project_plane |
| The class Project_plane calls the member function plane() on an instance of type Node . More...
|
|
struct | Project_point |
| The class Project_point calls the member function point() on an instance of type Node . More...
|
|
struct | Project_prev |
| The class Project_prev calls the member function prev() on an instance of type Node . More...
|
|
struct | Project_vertex |
| The class Project_vertex calls the member function vertex() on an instance of type Node . More...
|
|
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 |
| The Quadruple class is an extension of std::pair . More...
|
|
class | Quotient |
|
class | Random_access_adaptor |
| The class Random_access_adaptor provides a random access for data structures. More...
|
|
struct | Random_access_circulator_base |
|
class | Random_access_circulator_ptrbase |
|
struct | Random_access_circulator_tag |
|
class | Random_access_value_adaptor |
| The class Random_access_value_adaptor provides a random access for data structures. More...
|
|
class | Rational_traits |
|
class | Ray_2 |
|
class | Ray_3 |
|
class | Real_timer |
|
class | Reflection |
|
struct | Root_of_traits |
|
class | Rotation |
|
class | Scaling |
|
class | Seam_mesh |
|
class | Segment_2 |
|
class | Segment_3 |
|
struct | Sequential_tag |
| Tag used to disable concurrency. More...
|
|
class | Set_ieee_double_precision |
|
struct | Simple_cartesian |
|
struct | Simple_homogeneous |
|
class | Sixtuple |
| The Sixtuple class stores a homogeneous (same type) sixtuple of objects of type T . More...
|
|
class | Spatial_lock_grid_3 |
| The class Spatial_lock_grid_3 allows to lock points with coordinates (x, y, z) in a 3D grid. More...
|
|
class | Sphere_3 |
|
class | Sqrt_extension |
|
class | Surface_mesh |
|
class | Tetrahedron_3 |
|
class | Threetuple |
|
class | Timer |
|
class | Translation |
|
class | Triangle_2 |
|
class | Triangle_3 |
|
class | Triangulation_face_base_with_id_2 |
|
class | Triangulation_vertex_base_with_id_2 |
|
class | Triple |
| The Triple class is an extension of std::pair . More...
|
|
class | Twotuple |
| The Twotuple class stores a homogeneous (same type) pair of objects of type T . More...
|
|
class | Uncertain |
| An object of the class Uncertain represents an uncertainty on the value of type T . More...
|
|
class | Union_find |
|
class | Unique_hash_map |
|
struct | value_type_traits |
| Class providing the value type of an iterator, and in the case of an output iterator, a type of objects that can be put in it. More...
|
|
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 | Vertex_around_face_circulator |
|
class | Vertex_around_face_iterator |
|
class | Vertex_around_target_circulator |
|
class | Vertex_around_target_iterator |
|
class | Weighted_point_2 |
|
class | Weighted_point_3 |
|
|
std::string | data_file_path (const std::string &filename) |
|
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) |
|
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) |
|
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) |
|
bool | read_mesh (Surface_mesh< K > &sm, const std::string &filename) |
|
bool | write_mesh (const Surface_mesh< K > &mesh, const std::string &filename) |
|
int | read_3mf (const std::string &filename, std::vector< CGAL::Surface_mesh< Point > > &output) |
|
bool | read_off (std::istream &is, Surface_mesh< Point > &sm, const NamedParameters &np=parameters::default_values()) |
|
bool | read_off (Surface_mesh< Point > &sm, const std::string &filename) |
|
bool | write_off (std::ostream &os, const Surface_mesh< Point > &sm, const NamedParameters &np=parameters::default_values()) |
|
bool | write_off (const Surface_mesh< Point > &sm, const std::string &filename) |
|
bool | read_ply (std::istream &is, Surface_mesh< P > &sm, std::string &comments) |
|
bool | write_ply (std::ostream &os, const Surface_mesh< P > &sm, const std::string &comments) |
|
bool | write_ply (std::ostream &os, const Surface_mesh< P > &sm) |
|
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_valid_halfedge_graph (const Graph &g, bool verb=false) |
|
bool | is_valid_face_graph (const FaceGraph &g, bool verb=false) |
|
bool | is_valid_polygon_mesh (const Mesh &g, bool verb=false) |
|
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_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 ¢er=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT radius=1) |
|
boost::graph_traits< Graph >::halfedge_descriptor | make_grid (typename boost::graph_traits< Graph >::vertices_size_type i, typename boost::graph_traits< Graph >::vertices_size_type j, Graph &g, const CoordinateFunctor &calculator, bool triangulated=false) |
|
OutputIterator | expand_face_selection (const FaceRange &selection, FaceGraph &fg, unsigned int k, IsFaceSelectedPMap is_selected, OutputIterator out) |
|
OutputIterator | reduce_face_selection (const FaceRange &selection, FaceGraph &fg, unsigned int k, IsFaceSelectedPMap is_selected, OutputIterator out) |
|
void | regularize_face_selection_borders (TriangleMesh &mesh, IsSelectedMap is_selected, double weight, const NamedParameters &np=parameters::default_values()) |
|
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=parameters::default_values(), const NamedParameters2 &np2=parameters::default_values()) |
|
bool | read_off (std::istream &is, Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | read_off (const char *fname, Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | write_off (std::ostream &os, const Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | write_off (const char *fname, const Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | write_vtp (std::ostream &os, const Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | write_wrl (std::ostream &os, const Graph &g, const NamedParameters &np=parameters::default_values()) |
|
double | alpha_expansion_graphcut (const InputGraph &input_graph, EdgeCostMap edge_cost_map, VertexLabelCostMap vertex_label_cost_map, VertexLabelMap vertex_label_map, const NamedParameters &np=parameters::default_values()) |
|
template<class ForwardIterator > |
std::pair< ForwardIterator, ForwardIterator > | min_max_element (ForwardIterator first, ForwardIterator last) |
| Computes the minimal and the maximal element of a range. More...
|
|
template<class ForwardIterator , class CompareMin , class CompareMax > |
std::pair< ForwardIterator, ForwardIterator > | min_max_element (ForwardIterator first, ForwardIterator last, CompareMin comp_min, CompareMax comp_max) |
| Computes the minimal and the maximal element of a range. More...
|
|
template<class T > |
std::array< T, N > | make_array (const T &...) |
|
template<typename CC_iterator > |
CC_safe_handle< CC_iterator > | make_cc_safe_handle (CC_iterator iterator) |
| The class make_cc_safe_handle function allows to build a CC_safe_handle from an iterator on a Compact_container (or Concurrent_compact_container ). More...
|
|
template<class F > |
Compare_to_less< F > | compare_to_less (const F &f) |
| Changes a functor returning a Comparison_result to one which returns a bool. More...
|
|
template<typename T > |
Iterator_range< T > | make_range (const T &b, const T &e) |
|
template<typename T > |
T | range_begin (Iterator_range< T > &x) |
|
template<typename T > |
T | range_end (Iterator_range< T > &x) |
|
template<typename T > |
T | range_begin (const Iterator_range< T > &x) |
|
template<typename T > |
T | range_end (const Iterator_range< T > &x) |
|