| area() const | CGAL::Polygon_2< Traits_, Container_ > | |
| bbox() const | CGAL::Polygon_2< Traits_, Container_ > | |
| begin() | CGAL::Polygon_2< Traits_, Container_ > | |
| begin() 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_ > | |
| clear() | CGAL::Polygon_2< Traits_, Container_ > | |
| Container typedef | CGAL::Polygon_2< Traits_, Container_ > | |
| container() const | CGAL::Polygon_2< Traits_, Container_ > | |
| container() | CGAL::Polygon_2< Traits_, Container_ > | |
| edge(std::size_t i) const | CGAL::Polygon_2< Traits_, Container_ > | |
| Edge_const_circulator typedef | CGAL::Polygon_2< Traits_, Container_ > | |
| Edge_const_iterator typedef | CGAL::Polygon_2< Traits_, Container_ > | |
| edges() const | CGAL::Polygon_2< Traits_, Container_ > | |
| Edges typedef | 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_ > | |
| end() | CGAL::Polygon_2< Traits_, Container_ > | |
| end() const | CGAL::Polygon_2< Traits_, Container_ > | |
| erase(Vertex_iterator i) | CGAL::Polygon_2< Traits_, Container_ > | |
| erase(Vertex_circulator i) | CGAL::Polygon_2< Traits_, Container_ > | |
| erase(Vertex_iterator first, Vertex_iterator last) | CGAL::Polygon_2< Traits_, Container_ > | |
| FT typedef | CGAL::Polygon_2< Traits_, Container_ > | |
| has_on_boundary(const Point_2 &q) const | CGAL::Polygon_2< Traits_, Container_ > | |
| has_on_bounded_side(const Point_2 &q) const | CGAL::Polygon_2< Traits_, Container_ > | |
| has_on_negative_side(const Point_2 &q) const | CGAL::Polygon_2< Traits_, Container_ > | |
| has_on_positive_side(const Point_2 &q) const | CGAL::Polygon_2< Traits_, Container_ > | |
| has_on_unbounded_side(const Point_2 &q) const | CGAL::Polygon_2< Traits_, Container_ > | |
| insert(Vertex_iterator i, const Point_2 &q) | CGAL::Polygon_2< Traits_, Container_ > | |
| insert(Vertex_circulator i, const Point_2 &q) | CGAL::Polygon_2< Traits_, Container_ > | |
| insert(Vertex_iterator i, InputIterator first, InputIterator last) | CGAL::Polygon_2< Traits_, Container_ > | |
| insert(Vertex_circulator i, InputIterator first, InputIterator last) | CGAL::Polygon_2< Traits_, Container_ > | |
| is_clockwise_oriented() const | CGAL::Polygon_2< Traits_, Container_ > | |
| is_collinear_oriented() const | CGAL::Polygon_2< Traits_, Container_ > | |
| is_convex() const | CGAL::Polygon_2< Traits_, Container_ > | |
| is_counterclockwise_oriented() 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_, Container1_P > &p1, const Polygon_2< Traits_, Container2_P > &p2) | CGAL::Polygon_2< Traits_, Container_ > | |
| operator<<(std::ostream &os, const Polygon_2< Traits_, Container_ > &p) | CGAL::Polygon_2< Traits_, Container_ > | related |
| operator==(const Polygon_2< Traits_, Container1_P > &p1, const Polygon_2< Traits_, Container2_P > &p2) | CGAL::Polygon_2< Traits_, Container_ > | |
| operator>>(std::istream &is, Polygon_2< Traits_, Container_ > &p) | CGAL::Polygon_2< Traits_, Container_ > | related |
| operator[](std::size_t i) const | CGAL::Polygon_2< Traits_, Container_ > | |
| operator[](std::size_t i) | 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 typedef | CGAL::Polygon_2< Traits_, Container_ > | |
| Polygon_2()=default | CGAL::Polygon_2< Traits_, Container_ > | |
| Polygon_2(const Traits &p_traits) | CGAL::Polygon_2< Traits_, Container_ > | |
| Polygon_2(InputIterator first, InputIterator last, Traits p_traits=Traits()) | CGAL::Polygon_2< Traits_, Container_ > | |
| push_back(const Point_2 &x) | CGAL::Polygon_2< Traits_, Container_ > | |
| reserve(std::size_t s) | CGAL::Polygon_2< Traits_, Container_ > | |
| resize(std::size_t s) | CGAL::Polygon_2< Traits_, Container_ > | |
| reverse_orientation() | CGAL::Polygon_2< Traits_, Container_ > | |
| right_vertex() const | CGAL::Polygon_2< Traits_, Container_ > | |
| Segment_2 typedef | CGAL::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_, Container_ > &p) | CGAL::Polygon_2< Traits_, Container_ > | related |
| vertex(std::size_t i) const | CGAL::Polygon_2< Traits_, Container_ > | |
| vertex(std::size_t i) | CGAL::Polygon_2< Traits_, Container_ > | |
| Vertex_circulator typedef | CGAL::Polygon_2< Traits_, Container_ > | |
| Vertex_iterator typedef | CGAL::Polygon_2< Traits_, Container_ > | |
| Vertices typedef | CGAL::Polygon_2< Traits_, Container_ > | |
| vertices() 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_ > | |
1.9.6