Navigation: Up, Table of Contents, Bibliography, Index, Title Page

The CGAL Kernel Manual
Index

Classes
- CGAL_ch_...
- CGAL_convex_hull_constructive_traits_2<R>
- CGAL_convex_hull_rat_leda_traits_2
- CGAL_convex_hull_traits_2<R>
- CGAL_Delaunay_triangulation_2<Traits>
- CGAL_Min_circle_2<Traits>
- CGAL_Min_circle_2_adapterC2<PT,DA>
- CGAL_Min_circle_2_adapterH2<PT,DA>
- CGAL_Optimisation_traits_2<R>
- CGAL_Polygon_2<Traits,Container>
- CGAL_Range_segment_tree_traits_set_2<R>
- CGAL_Range_segment_tree_traits_set_3<R>
- CGAL_Range_tree_d<Data, Window, Traits>
- CGAL_Range_tree_k<Traits>
- CGAL_Range_tree_traits_map_2<R,T>
- CGAL_Range_tree_traits_map_3<R>
- CGAL_Segment_tree_d<Data, Window, Traits>
- CGAL_Segment_tree_k<Traits>
- CGAL_Segment_tree_traits_map_2<R,T>
- CGAL_Segment_tree_traits_map_3<R>
- CGAL_Tree_anchor<Data, Window>
- CGAL_Triangulation_2<Traits>
- CGAL_Triangulation_euclidean_traits_2<R>
- CGAL_Triangulation_euclidean_xy_traits_3<R>
- CGAL_Triangulation_face<V>
- CGAL_Triangulation_l_infty_traits_2<R>
- CGAL_Triangulation_vertex<P>
- Distance
- Face
- Interval_traits
- Point_traits
- Range_segment_tree_traits_k
- Traits
- Traits
- Vertex
Nested Types
- CGAL_convex_hull_constructive_traits_2<R>::Greater_xy
- CGAL_convex_hull_constructive_traits_2<R>::Greater_yx
- CGAL_convex_hull_constructive_traits_2<R>::Less_dist_to_line
- CGAL_convex_hull_constructive_traits_2<R>::Less_rotate_ccw
- CGAL_convex_hull_constructive_traits_2<R>::Less_xy
- CGAL_convex_hull_constructive_traits_2<R>::Less_yx
- CGAL_convex_hull_constructive_traits_2<R>::Right_of_line
- CGAL_convex_hull_rat_leda_traits_2::Greater_xy
- CGAL_convex_hull_rat_leda_traits_2::Greater_yx
- CGAL_convex_hull_rat_leda_traits_2::Less_rotate_ccw
- CGAL_convex_hull_rat_leda_traits_2::Less_xy
- CGAL_convex_hull_rat_leda_traits_2::Less_yx
- CGAL_convex_hull_rat_leda_traits_2::Right_of_line
- CGAL_convex_hull_traits_2<R>::Greater_xy
- CGAL_convex_hull_traits_2<R>::Greater_yx
- CGAL_convex_hull_traits_2<R>::Less_dist_to_line
- CGAL_convex_hull_traits_2<R>::Less_rotate_ccw
- CGAL_convex_hull_traits_2<R>::Less_xy
- CGAL_convex_hull_traits_2<R>::Less_yx
- CGAL_convex_hull_traits_2<R>::Right_of_line
- CGAL_Min_circle_2<Traits>::Point_iterator
- CGAL_Min_circle_2<Traits>::Support_point_iterator
- CGAL_Min_circle_2<Traits>::Traits
- CGAL_Min_circle_2_adapterC2<PT,DA>::Circle
- CGAL_Min_circle_2_adapterC2<PT,DA>::DA
- CGAL_Min_circle_2_adapterC2<PT,DA>::Point
- CGAL_Min_circle_2_adapterH2<PT,DA>::Circle
- CGAL_Min_circle_2_adapterH2<PT,DA>::DA
- CGAL_Min_circle_2_adapterH2<PT,DA>::Point
- CGAL_Polygon_2<Traits,Container>::Edge_const_circulator
- CGAL_Polygon_2<Traits,Container>::Edge_const_iterator
- CGAL_Polygon_2<Traits,Container>::Traits
- CGAL_Polygon_2<Traits,Container>::Vertex_circulator
- CGAL_Polygon_2<Traits,Container>::Vertex_const_circulator
- CGAL_Polygon_2<Traits,Container>::Vertex_const_iterator
- CGAL_Polygon_2<Traits,Container>::Vertex_iterator
- CGAL_Range_tree_d<Data, Window, Traits>::Data
- CGAL_Range_tree_d<Data, Window, Traits>::Traits
- CGAL_Range_tree_d<Data, Window, Traits>::Window
- CGAL_Range_tree_k<Traits>::Traits
- CGAL_Segment_tree_d<Data, Window, Traits>::Data
- CGAL_Segment_tree_d<Data, Window, Traits>::Traits
- CGAL_Segment_tree_d<Data, Window, Traits>::Window
- CGAL_Segment_tree_k<Traits>::Traits
- CGAL_Tree_anchor<Data, Window>::Data
- CGAL_Tree_anchor<Data, Window>::Window
- CGAL_Triangulation_2<Traits>::Convex_hull_vertex_circulator
- CGAL_Triangulation_2<Traits>::Edge_iterator
- CGAL_Triangulation_2<Traits>::Face_circulator
- CGAL_Triangulation_2<Traits>::Face_iterator
- CGAL_Triangulation_2<Traits>::Line_face_circulator
- CGAL_Triangulation_2<Traits>::Traits
- CGAL_Triangulation_2<Traits>::Vertex_circulator
- CGAL_Triangulation_2<Traits>::Vertex_iterator
- CGAL_Triangulation_euclidean_traits_2<R>::Face
- CGAL_Triangulation_euclidean_traits_2<R>::Vertex
- CGAL_Triangulation_euclidean_xy_traits_3<R>::Face
- CGAL_Triangulation_euclidean_xy_traits_3<R>::Vertex
- Distance::Point
- Distance::Traits
- Face::Vertex
- Interval_traits::Data
- Interval_traits::Key
- Interval_traits::Window
- Point_traits::Data
- Point_traits::Key
- Point_traits::Window
- Range_segment_tree_traits_k::compare_i
- Range_segment_tree_traits_k::high_i
- Range_segment_tree_traits_k::Interval
- Range_segment_tree_traits_k::key_i
- Range_segment_tree_traits_k::Key
- Range_segment_tree_traits_k::Key_i
- Range_segment_tree_traits_k::low_i
- Traits::Distance
- Traits::Face
- Traits::Greater_xy
- Traits::Greater_yx
- Traits::Less_dist_to_line
- Traits::Less_rotate_ccw
- Traits::Less_xy
- Traits::Less_yx
- Traits::Point
- Traits::Point_2
- Traits::Right_of_line
- Traits::Segment
- Traits::Triangle
- Traits::Vertex
- Vertex::Face
- Vertex::Face_circulator
- Vertex::Point
- Vertex::Vertex_circulator
Structs
Enums
- CGAL_Triangulation_2<Traits>::Locate_type
Enum Tags
- CGAL_Triangulation_2<Traits>::COLLINEAR_OUTSIDE
- CGAL_Triangulation_2<Traits>::EDGE
- CGAL_Triangulation_2<Traits>::FACE
- CGAL_Triangulation_2<Traits>::OUTSIDE
- CGAL_Triangulation_2<Traits>::VERTEX=0
- COLLINEAR_OUTSIDE
- EDGE
- FACE
- OUTSIDE
- VERTEX=0
Typedefs
- CGAL_convex_hull_constructive_traits_2<R>::Line_2
- CGAL_convex_hull_constructive_traits_2<R>::Point_2
- CGAL_convex_hull_rat_leda_traits_2::Point_2
- CGAL_convex_hull_traits_2<R>::Point_2
- CGAL_Min_circle_2<Traits>::Circle
- CGAL_Min_circle_2<Traits>::Point
- CGAL_Optimisation_traits_2<R>::Circle
- CGAL_Optimisation_traits_2<R>::Point
- CGAL_Polygon_2<Traits,Container>::Iso_rectangle
- CGAL_Polygon_2<Traits,Container>::Point
- CGAL_Polygon_2<Traits,Container>::Segment
- CGAL_Polygon_2<Traits,Container>::Triangle
- CGAL_Range_segment_tree_traits_set_2<R>::Interval
- CGAL_Range_segment_tree_traits_set_2<R>::Key
- CGAL_Range_segment_tree_traits_set_3<R>::Interval
- CGAL_Range_segment_tree_traits_set_3<R>::Key
- CGAL_Range_tree_k<Traits>::Interval
- CGAL_Range_tree_k<Traits>::Key
- CGAL_Range_tree_traits_map_2<R,T>::Interval
- CGAL_Range_tree_traits_map_2<R,T>::Key
- CGAL_Range_tree_traits_map_3<R>::Interval
- CGAL_Range_tree_traits_map_3<R>::Key
- CGAL_Segment_tree_k<Traits>::Interval
- CGAL_Segment_tree_k<Traits>::Key
- CGAL_Segment_tree_traits_map_2<R,T>::Interval
- CGAL_Segment_tree_traits_map_2<R,T>::Key
- CGAL_Segment_tree_traits_map_3<R>::Interval
- CGAL_Segment_tree_traits_map_3<R>::Key
- CGAL_Triangulation_2<Traits>::Face
- CGAL_Triangulation_2<Traits>::Point
- CGAL_Triangulation_2<Traits>::Segment
- CGAL_Triangulation_2<Traits>::Triangle
- CGAL_Triangulation_2<Traits>::Vertex
- CGAL_Triangulation_face<V>::Vertex
- CGAL_Triangulation_vertex<P>::Face
- CGAL_Triangulation_vertex<P>::Point
Global Variables and Consts
Functions
- CGAL_Bounded_side bounded_side( const Traits::Point& q);
- void CGAL_area_2( ForwardIterator first, ForwardIterator last, Numbertype& result);
- CGAL_Bbox_2 CGAL_bbox_2( InputIterator first, InputIterator last);
- ForwardIterator CGAL_bottom_vertex_2( ForwardIterator first, ForwardIterator last);
- OutputIterator CGAL_ch_akl_toussaint( ForwardIterator first, ForwardIterator last, OutputIterator result, const Traits& ch_traits);
- OutputIterator CGAL_ch_eddy( InputIterator first, InputIterator last, OutputIterator result, const Traits& ch_traits);
- void CGAL_ch_e_point( ForwardIterator first, ForwardIterator last, ForwardIterator& e, const Traits & ch_traits);
- OutputIterator CGAL_ch_graham_andrew( InputIterator first, InputIterator last, OutputIterator result, const Traits & ch_traits);
- OutputIterator CGAL_ch_jarvis( ForwardIterator first, ForwardIterator last, OutputIterator result, const Traits& ch_traits);
- void CGAL_ch_nswe_point( ForwardIterator first, ForwardIterator last, ForwardIterator& n, ForwardIterator& s, ForwardIterator& w, ForwardIterator& e, const Traits & ch_traits);
- void CGAL_ch_ns_point( ForwardIterator first, ForwardIterator last, ForwardIterator& n, ForwardIterator& s, const Traits & ch_traits);
- void CGAL_ch_n_point( ForwardIterator first, ForwardIterator last, ForwardIterator& n, const Traits & ch_traits);
- void CGAL_ch_s_point( ForwardIterator first, ForwardIterator last, ForwardIterator& s, const Traits & ch_traits);
- void CGAL_ch_we_point( ForwardIterator first, ForwardIterator last, ForwardIterator& w, ForwardIterator& e, const Traits & ch_traits);
- void CGAL_ch_w_point( ForwardIterator first, ForwardIterator last, ForwardIterator& w, const Traits & ch_traits);
- OutputIterator CGAL_convex_hull_points_2( ForwardIterator first, ForwardIterator last, OutputIterator result, const Traits & ch_traits);
- OutputIterator CGAL_difference( const CGAL_Iso_rectangle_2<R> &A, const CGAL_Iso_rectangle_2<R> &B, OutputIterator list_of_objects_it);
- OutputIterator CGAL_difference( const CGAL_Polygon_2<R,Container> &A, const CGAL_Polygon_2<R,Container> &B, OutputIterator list_of_objects_it);
- OutputIterator CGAL_difference( const CGAL_Triangle_2<R> &A, const CGAL_Triangle_2<R> &B, OutputIterator list_of_objects_it);
- OutputIterator CGAL_difference( InputIterator Afirst, InputIterator Alast, InputIterator Bfirst, InputIterator Blast, Traits &, OutputIterator list_of_objects_it);
- bool CGAL_do_intersect( InputIterator Afirst, InputIterator Alast, InputIterator Bfirst, InputIterator Blast, Traits &);
- bool CGAL_do_intersect( const CGAL_Polygon_2<R,Container> &A, const CGAL_Polygon_2<R,Container> &B);
- bool CGAL_do_intersect( const CGAL_Iso_rectangle_2<R> &A, const CGAL_Iso_rectangle_2<R> &B);
- bool CGAL_do_intersect( const CGAL_Triangle_2<R> &A, const CGAL_Triangle_2<R> &B);
- OutputIterator CGAL_intersection( InputIterator Afirst, InputIterator Alast, InputIterator Bfirst, InputIterator Blast, Traits &, OutputIterator list_of_objects_it);
- OutputIterator CGAL_intersection( const CGAL_Iso_rectangle_2<R> &A, const CGAL_Iso_rectangle_2<R> &B, OutputIterator object_it);
- OutputIterator CGAL_intersection( const CGAL_Polygon_2<R,Container> &A, const CGAL_Polygon_2<R,Container> &B, OutputIterator list_of_objects_it);
- OutputIterator CGAL_intersection( const CGAL_Triangle_2<R> &A, const CGAL_Triangle_2<R> &B, OutputIterator object_it);
- bool CGAL_is_ccw_strongly_convex_2( ForwardIterator first, ForwardIterator last, const Traits & ch_traits);
- bool CGAL_is_convex_2( ForwardIterator first, ForwardIterator last);
- bool CGAL_is_cw_strongly_convex_2( ForwardIterator first, ForwardIterator last, const Traits & ch_traits);
- bool CGAL_is_simple_2( ForwardIterator first, ForwardIterator last);
- ForwardIterator CGAL_left_vertex_2( ForwardIterator first, ForwardIterator last);
- CGAL_Orientation CGAL_orientation_2( ForwardIterator first, ForwardIterator last);
- ForwardIterator CGAL_right_vertex_2( ForwardIterator first, ForwardIterator last);
- ForwardIterator CGAL_top_vertex_2( ForwardIterator first, ForwardIterator last);
- OutputIterator CGAL_union( const CGAL_Iso_rectangle_2<R> &A, const CGAL_Iso_rectangle_2<R> &B, OutputIterator list_of_objects_it);
- OutputIterator CGAL_union( const CGAL_Polygon_2<R,Container> &A, const CGAL_Polygon_2<R,Container> &B, OutputIterator list_of_objects_it);
- OutputIterator CGAL_union( const CGAL_Triangle_2<R> &A, const CGAL_Triangle_2<R> &B, OutputIterator list_of_objects_it);
- OutputIterator CGAL_union( InputIterator Afirst, InputIterator Alast, InputIterator Bfirst, InputIterator Blast, Traits &, OutputIterator list_of_objects_it);
- CGAL_Window_stream& operator <<( CGAL_Window_stream& ws, CGAL_Min_circle_2<Traits> const& min_circle);
- ostream& operator <<( ostream& os, CGAL_Min_circle_2<Traits> const& min_circle);
- ostream& operator <<( ostream& os, Circle const& circle);
- ostream& operator <<( ostream& os, PT const& p);
- ostream& operator <<( ostream& os, PT const& p);
- istream& operator >>( istream& is, CGAL_Min_circle_2<Traits> &min_circle);
- istream& operator >>( istream& is, Circle &circle);
- istream& operator >>( istream& is, PT &p);
- istream& operator >>( istream& is, PT &p);
- bool operator!=( const CGAL_Polygon_2<Traits,Container1>& p1, const CGAL_Polygon_2<Traits,Container2>& p2);
- CGAL_Window_stream& operator<<( CGAL_Window_stream& W, const CGAL_Triangulation_2<Traits>& T);
- ostream& operator<<( ostream& os, const CGAL_Triangulation_2<Traits>& T);
- ostream& operator<<( ostream& os, const CGAL_Polygon_2<Traits>& p);
- istream& operator>>( istream& is, const CGAL_Polygon_2<Traits>& p);
- istream& operator>>( istream& is, const CGAL_Triangulation_2<Traits>& T);
- bool operator==( const CGAL_Polygon_2<Traits,Container1>& p1, const CGAL_Polygon_2<Traits,Container2>& p2);
- CGAL_Oriented_side oriented_side( const Traits::Point& q)const;

Navigation: Table of Contents, Bibliography, Index, Title Page

The CGAL Project. Mon, June 30, 1997.

The CGAL Kernel Manual Index

The CGAL Kernel Manual
Index