\( \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.14 - 2D Polygons
CGAL::Polygon_2< Traits_P, Container_P > Member List

This is the complete list of members for CGAL::Polygon_2< Traits_P, Container_P >, including all inherited members.

area() constCGAL::Polygon_2< Traits_P, Container_P >
bbox() constCGAL::Polygon_2< Traits_P, Container_P >
bottom_vertex() constCGAL::Polygon_2< Traits_P, Container_P >
bounded_side(const Point_2 &value) constCGAL::Polygon_2< Traits_P, Container_P >
clear()CGAL::Polygon_2< Traits_P, Container_P >
Container typedefCGAL::Polygon_2< Traits_P, Container_P >
container() constCGAL::Polygon_2< Traits_P, Container_P >
edge(std::size_t i) constCGAL::Polygon_2< Traits_P, Container_P >
Edge_const_circulator typedefCGAL::Polygon_2< Traits_P, Container_P >
Edge_const_iterator typedefCGAL::Polygon_2< Traits_P, Container_P >
edges_begin() constCGAL::Polygon_2< Traits_P, Container_P >
edges_circulator() constCGAL::Polygon_2< Traits_P, Container_P >
edges_end() constCGAL::Polygon_2< Traits_P, Container_P >
erase(Vertex_iterator i)CGAL::Polygon_2< Traits_P, Container_P >
erase(Vertex_circulator i)CGAL::Polygon_2< Traits_P, Container_P >
erase(Vertex_iterator first, Vertex_iterator last)CGAL::Polygon_2< Traits_P, Container_P >
FT typedefCGAL::Polygon_2< Traits_P, Container_P >
has_on_boundary(const Point_2 &q) constCGAL::Polygon_2< Traits_P, Container_P >
has_on_bounded_side(const Point_2 &q) constCGAL::Polygon_2< Traits_P, Container_P >
has_on_negative_side(const Point_2 &q) constCGAL::Polygon_2< Traits_P, Container_P >
has_on_positive_side(const Point_2 &q) constCGAL::Polygon_2< Traits_P, Container_P >
has_on_unbounded_side(const Point_2 &q) constCGAL::Polygon_2< Traits_P, Container_P >
insert(Vertex_iterator i, const Point_2 &q)CGAL::Polygon_2< Traits_P, Container_P >
insert(Vertex_circulator i, const Point_2 &q)CGAL::Polygon_2< Traits_P, Container_P >
insert(Vertex_iterator i, InputIterator first, InputIterator last)CGAL::Polygon_2< Traits_P, Container_P >
insert(Vertex_circulator i, InputIterator first, InputIterator last)CGAL::Polygon_2< Traits_P, Container_P >
is_clockwise_oriented() constCGAL::Polygon_2< Traits_P, Container_P >
is_collinear_oriented() constCGAL::Polygon_2< Traits_P, Container_P >
is_convex() constCGAL::Polygon_2< Traits_P, Container_P >
is_counterclockwise_oriented() constCGAL::Polygon_2< Traits_P, Container_P >
is_empty() constCGAL::Polygon_2< Traits_P, Container_P >
is_simple() constCGAL::Polygon_2< Traits_P, Container_P >
left_vertex() constCGAL::Polygon_2< Traits_P, Container_P >
operator!=(const Polygon_2< Traits_P, Container1_P > &p1, const Polygon_2< Traits_P, Container2_P > &p2)CGAL::Polygon_2< Traits_P, Container_P >
operator<<(std::ostream &os, const Polygon_2< Traits_P, Container_P > &p)CGAL::Polygon_2< Traits_P, Container_P >
operator==(const Polygon_2< Traits_P, Container1_P > &p1, const Polygon_2< Traits_P, Container2_P > &p2)CGAL::Polygon_2< Traits_P, Container_P >
operator>>(std::istream &is, Polygon_2< Traits_P, Container_P > &p)CGAL::Polygon_2< Traits_P, Container_P >
operator[](std::size_t i) constCGAL::Polygon_2< Traits_P, Container_P >
orientation() constCGAL::Polygon_2< Traits_P, Container_P >
oriented_side(const Point_2 &value) constCGAL::Polygon_2< Traits_P, Container_P >
Point_2 typedefCGAL::Polygon_2< Traits_P, Container_P >
Polygon_2(const Traits &p_traits=Traits())CGAL::Polygon_2< Traits_P, Container_P >
Polygon_2(const Polygon_2< Traits_P, Container_P > &polygon)CGAL::Polygon_2< Traits_P, Container_P >
Polygon_2(InputIterator first, InputIterator last, Traits p_traits=Traits())CGAL::Polygon_2< Traits_P, Container_P >
push_back(const Point_2 &x)CGAL::Polygon_2< Traits_P, Container_P >
reverse_orientation()CGAL::Polygon_2< Traits_P, Container_P >
right_vertex() constCGAL::Polygon_2< Traits_P, Container_P >
Segment_2 typedefCGAL::Polygon_2< Traits_P, Container_P >
set(Vertex_iterator i, const Point_2 &q)CGAL::Polygon_2< Traits_P, Container_P >
size() constCGAL::Polygon_2< Traits_P, Container_P >
top_vertex() constCGAL::Polygon_2< Traits_P, Container_P >
transform(const Transformation &t, const Polygon_2< Traits_P, Container_P > &p)CGAL::Polygon_2< Traits_P, Container_P >
vertex(std::size_t i) constCGAL::Polygon_2< Traits_P, Container_P >
Vertex_circulator typedefCGAL::Polygon_2< Traits_P, Container_P >
Vertex_iterator typedefCGAL::Polygon_2< Traits_P, Container_P >
vertices_begin() constCGAL::Polygon_2< Traits_P, Container_P >
vertices_circulator() constCGAL::Polygon_2< Traits_P, Container_P >
vertices_end() constCGAL::Polygon_2< Traits_P, Container_P >