\( \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.3 - 2D Polygons
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Polygon_2< _Traits, _Container > Member List

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

area() const CGAL::Polygon_2< _Traits, _Container >
bbox() const CGAL::Polygon_2< _Traits, _Container >
bottom_vertex() const CGAL::Polygon_2< _Traits, _Container >
bounded_side(const Point_2 &value) const CGAL::Polygon_2< _Traits, _Container >
Container typedefCGAL::Polygon_2< _Traits, _Container >
container() const CGAL::Polygon_2< _Traits, _Container >
edge(std::size_t i) const CGAL::Polygon_2< _Traits, _Container >
edges_begin() const CGAL::Polygon_2< _Traits, _Container >
edges_circulator() const CGAL::Polygon_2< _Traits, _Container >
edges_end() const CGAL::Polygon_2< _Traits, _Container >
FT typedefCGAL::Polygon_2< _Traits, _Container >
insert(Vertex_iterator i, const Point_2 &q)CGAL::Polygon_2< _Traits, _Container >
is_convex() const CGAL::Polygon_2< _Traits, _Container >
is_empty() const CGAL::Polygon_2< _Traits, _Container >
is_simple() const CGAL::Polygon_2< _Traits, _Container >
left_vertex() const CGAL::Polygon_2< _Traits, _Container >
operator!=(const Polygon_2< Traits_P, Container1_P > &p1, const Polygon_2< Traits_P, Container2_P > &p2)CGAL::Polygon_2< _Traits, _Container >
operator<<(std::ostream &os, const Polygon_2< Traits_P, Container_P > &p)CGAL::Polygon_2< _Traits, _Container >
operator==(const Polygon_2< Traits_P, Container1_P > &p1, const Polygon_2< Traits_P, Container2_P > &p2)CGAL::Polygon_2< _Traits, _Container >
operator>>(std::istream &is, Polygon_2< Traits_P, Container_P > &p)CGAL::Polygon_2< _Traits, _Container >
operator[](std::size_t i) const CGAL::Polygon_2< _Traits, _Container >
orientation() const CGAL::Polygon_2< _Traits, _Container >
oriented_side(const Point_2 &value) const CGAL::Polygon_2< _Traits, _Container >
Point_2 typedefCGAL::Polygon_2< _Traits, _Container >
Polygon_2(const Traits &p_traits=Traits())CGAL::Polygon_2< _Traits, _Container >
Polygon_2(const Polygon_2< Traits_P, Container_P > &polygon)CGAL::Polygon_2< _Traits, _Container >
Polygon_2(InputIterator first, InputIterator last, Traits p_traits=Traits())CGAL::Polygon_2< _Traits, _Container >
right_vertex() const CGAL::Polygon_2< _Traits, _Container >
Segment_2 typedefCGAL::Polygon_2< _Traits, _Container >
set(Vertex_iterator i, const Point_2 &q)CGAL::Polygon_2< _Traits, _Container >
size() const CGAL::Polygon_2< _Traits, _Container >
top_vertex() const CGAL::Polygon_2< _Traits, _Container >
transform(const Transformation &t, const Polygon_2< Traits_P, Container_P > &p)CGAL::Polygon_2< _Traits, _Container >
vertex(std::size_t i) const CGAL::Polygon_2< _Traits, _Container >
vertices_begin() const CGAL::Polygon_2< _Traits, _Container >
vertices_circulator() const CGAL::Polygon_2< _Traits, _Container >
vertices_end() const CGAL::Polygon_2< _Traits, _Container >