\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.8 - 2D Arrangements

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Arrangement_2< Traits, Dcel > Member List

This is the complete list of members for CGAL::Arrangement_2< Traits, Dcel >, including all inherited members.

Arrangement_2() | CGAL::Arrangement_2< Traits, Dcel > |
Arrangement_2(const Self &other) | CGAL::Arrangement_2< Traits, Dcel > |
Arrangement_2(const Traits_2 *traits) | CGAL::Arrangement_2< Traits, Dcel > |
assign(const Self &other) | CGAL::Arrangement_2< Traits, Dcel > |
Ccb_halfedge_circulator typedef | CGAL::Arrangement_2< Traits, Dcel > |
clear() | CGAL::Arrangement_2< Traits, Dcel > |
Edge_iterator typedef | CGAL::Arrangement_2< Traits, Dcel > |
edges_begin() | CGAL::Arrangement_2< Traits, Dcel > |
edges_end() | CGAL::Arrangement_2< Traits, Dcel > |
Face_handle typedef | CGAL::Arrangement_2< Traits, Dcel > |
Face_iterator typedef | CGAL::Arrangement_2< Traits, Dcel > |
faces_begin() | CGAL::Arrangement_2< Traits, Dcel > |
faces_end() | CGAL::Arrangement_2< Traits, Dcel > |
fictitious_face() | CGAL::Arrangement_2< Traits, Dcel > |
get_traits() | CGAL::Arrangement_2< Traits, Dcel > |
Halfedge_around_vertex_circulator typedef | CGAL::Arrangement_2< Traits, Dcel > |
Halfedge_handle typedef | CGAL::Arrangement_2< Traits, Dcel > |
Halfedge_iterator typedef | CGAL::Arrangement_2< Traits, Dcel > |
halfedges_begin() | CGAL::Arrangement_2< Traits, Dcel > |
halfedges_end() | CGAL::Arrangement_2< Traits, Dcel > |
Hole_iterator typedef | CGAL::Arrangement_2< Traits, Dcel > |
insert_at_vertices(const X_monotone_curve_2 &c, Vertex_handle v1, Vertex_handle v2) | CGAL::Arrangement_2< Traits, Dcel > |
insert_at_vertices(const X_monotone_curve_2 &c, Halfedge_handle pred1, Vertex_handle v2) | CGAL::Arrangement_2< Traits, Dcel > |
insert_at_vertices(const X_monotone_curve_2 &c, Halfedge_handle pred1, Halfedge_handle pred2) | CGAL::Arrangement_2< Traits, Dcel > |
insert_from_left_vertex(const X_monotone_curve_2 &c, Vertex_handle v) | CGAL::Arrangement_2< Traits, Dcel > |
insert_from_left_vertex(const X_monotone_curve_2 &c, Halfedge_handle pred) | CGAL::Arrangement_2< Traits, Dcel > |
insert_from_left_vertex(const X_monotone_curve_2 &c, Halfedge_handle pred, Halfedge_handle fict_pred) | CGAL::Arrangement_2< Traits, Dcel > |
insert_from_right_vertex(const X_monotone_curve_2 &c, Vertex_handle v) | CGAL::Arrangement_2< Traits, Dcel > |
insert_from_right_vertex(const X_monotone_curve_2 &c, Halfedge_handle pred) | CGAL::Arrangement_2< Traits, Dcel > |
insert_from_right_vertex(const X_monotone_curve_2 &c, Halfedge_handle pred, Halfedge_handle fict_pred) | CGAL::Arrangement_2< Traits, Dcel > |
insert_in_face_interior(const Point_2 &p, Face_handle f) | CGAL::Arrangement_2< Traits, Dcel > |
insert_in_face_interior(const X_monotone_curve_2 &c, Face_handle f) | CGAL::Arrangement_2< Traits, Dcel > |
insert_in_face_interior(const X_monotone_curve_2 &c, Halfedge_handle fict_pred1, Halfedge_handle fict_pred2=Halfedge_handle()) | CGAL::Arrangement_2< Traits, Dcel > |
is_empty() const | CGAL::Arrangement_2< Traits, Dcel > |
is_valid() const | CGAL::Arrangement_2< Traits, Dcel > |
Isolated_vertex_iterator typedef | CGAL::Arrangement_2< Traits, Dcel > |
merge_edge(Halfedge_handle e1, Halfedge_handle e2, const X_monotone_curve_2 &c) | CGAL::Arrangement_2< Traits, Dcel > |
modify_edge(Halfedge_handle e, const X_monotone_curve_2 &c) | CGAL::Arrangement_2< Traits, Dcel > |
modify_vertex(Vertex_handle v, const Point_2 &p) | CGAL::Arrangement_2< Traits, Dcel > |
non_const_handle(Vertex_const_handle v) | CGAL::Arrangement_2< Traits, Dcel > |
non_const_handle(Halfedge_const_handle e) | CGAL::Arrangement_2< Traits, Dcel > |
non_const_handle(Face_const_handle f) | CGAL::Arrangement_2< Traits, Dcel > |
number_of_edges() const | CGAL::Arrangement_2< Traits, Dcel > |
number_of_faces() const | CGAL::Arrangement_2< Traits, Dcel > |
number_of_halfedges() const | CGAL::Arrangement_2< Traits, Dcel > |
number_of_isolated_vertices() const | CGAL::Arrangement_2< Traits, Dcel > |
number_of_unbounded_faces() const | CGAL::Arrangement_2< Traits, Dcel > |
number_of_vertices() const | CGAL::Arrangement_2< Traits, Dcel > |
number_of_vertices_at_infinity() const | CGAL::Arrangement_2< Traits, Dcel > |
operator=(other) | CGAL::Arrangement_2< Traits, Dcel > |
Point_2 typedef | CGAL::Arrangement_2< Traits, Dcel > |
remove_edge(Halfedge_handle e, bool remove_source=true, bool remove_target=true) | CGAL::Arrangement_2< Traits, Dcel > |
remove_isolated_vertex(Vertex_handle v) | CGAL::Arrangement_2< Traits, Dcel > |
Self typedef | CGAL::Arrangement_2< Traits, Dcel > |
Size typedef | CGAL::Arrangement_2< Traits, Dcel > |
split_edge(Halfedge_handle e, const X_monotone_curve_2 &c1, const X_monotone_curve_2 &c2) | CGAL::Arrangement_2< Traits, Dcel > |
Traits_2 typedef | CGAL::Arrangement_2< Traits, Dcel > |
unbounded_face() | CGAL::Arrangement_2< Traits, Dcel > |
Unbounded_face_iterator typedef | CGAL::Arrangement_2< Traits, Dcel > |
unbounded_faces_begin() | CGAL::Arrangement_2< Traits, Dcel > |
unbounded_faces_end() | CGAL::Arrangement_2< Traits, Dcel > |
Vertex_handle typedef | CGAL::Arrangement_2< Traits, Dcel > |
Vertex_iterator typedef | CGAL::Arrangement_2< Traits, Dcel > |
vertices_begin() | CGAL::Arrangement_2< Traits, Dcel > |
vertices_end() | CGAL::Arrangement_2< Traits, Dcel > |
X_monotone_curve_2 typedef | CGAL::Arrangement_2< Traits, Dcel > |