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() const	CGAL::Polygon_2< Traits_P, Container_P >
bbox() const	CGAL::Polygon_2< Traits_P, Container_P >
begin()	CGAL::Polygon_2< Traits_P, Container_P >
begin() const	CGAL::Polygon_2< Traits_P, Container_P >
bottom_vertex() const	CGAL::Polygon_2< Traits_P, Container_P >
bounded_side(const Point_2 &value) const	CGAL::Polygon_2< Traits_P, Container_P >
clear()	CGAL::Polygon_2< Traits_P, Container_P >
Container typedef	CGAL::Polygon_2< Traits_P, Container_P >
container() const	CGAL::Polygon_2< Traits_P, Container_P >
container()	CGAL::Polygon_2< Traits_P, Container_P >
edge(std::size_t i) const	CGAL::Polygon_2< Traits_P, Container_P >
Edge_const_circulator typedef	CGAL::Polygon_2< Traits_P, Container_P >
Edge_const_iterator typedef	CGAL::Polygon_2< Traits_P, Container_P >
edges() const	CGAL::Polygon_2< Traits_P, Container_P >
Edges typedef	CGAL::Polygon_2< Traits_P, Container_P >
edges_begin() const	CGAL::Polygon_2< Traits_P, Container_P >
edges_circulator() const	CGAL::Polygon_2< Traits_P, Container_P >
edges_end() const	CGAL::Polygon_2< Traits_P, Container_P >
end()	CGAL::Polygon_2< Traits_P, Container_P >
end() const	CGAL::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 typedef	CGAL::Polygon_2< Traits_P, Container_P >
has_on_boundary(const Point_2 &q) const	CGAL::Polygon_2< Traits_P, Container_P >
has_on_bounded_side(const Point_2 &q) const	CGAL::Polygon_2< Traits_P, Container_P >
has_on_negative_side(const Point_2 &q) const	CGAL::Polygon_2< Traits_P, Container_P >
has_on_positive_side(const Point_2 &q) const	CGAL::Polygon_2< Traits_P, Container_P >
has_on_unbounded_side(const Point_2 &q) const	CGAL::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() const	CGAL::Polygon_2< Traits_P, Container_P >
is_collinear_oriented() const	CGAL::Polygon_2< Traits_P, Container_P >
is_convex() const	CGAL::Polygon_2< Traits_P, Container_P >
is_counterclockwise_oriented() const	CGAL::Polygon_2< Traits_P, Container_P >
is_empty() const	CGAL::Polygon_2< Traits_P, Container_P >
is_simple() const	CGAL::Polygon_2< Traits_P, Container_P >
left_vertex() const	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::ostream &os, const Polygon_2< Traits_P, Container_P > &p)	CGAL::Polygon_2< Traits_P, Container_P >	related
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 >	related
operator[](std::size_t i) const	CGAL::Polygon_2< Traits_P, Container_P >
operator[](std::size_t i)	CGAL::Polygon_2< Traits_P, Container_P >
orientation() const	CGAL::Polygon_2< Traits_P, Container_P >
oriented_side(const Point_2 &value) const	CGAL::Polygon_2< Traits_P, Container_P >
Point_2 typedef	CGAL::Polygon_2< Traits_P, Container_P >
Polygon_2()=default	CGAL::Polygon_2< Traits_P, Container_P >
Polygon_2(const Traits &p_traits)	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 >
reserve(std::size_t s)	CGAL::Polygon_2< Traits_P, Container_P >
resize(std::size_t s)	CGAL::Polygon_2< Traits_P, Container_P >
reverse_orientation()	CGAL::Polygon_2< Traits_P, Container_P >
right_vertex() const	CGAL::Polygon_2< Traits_P, Container_P >
Segment_2 typedef	CGAL::Polygon_2< Traits_P, Container_P >
set(Vertex_iterator i, const Point_2 &q)	CGAL::Polygon_2< Traits_P, Container_P >
size() const	CGAL::Polygon_2< Traits_P, Container_P >
top_vertex() const	CGAL::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 >	related
vertex(std::size_t i) const	CGAL::Polygon_2< Traits_P, Container_P >
vertex(std::size_t i)	CGAL::Polygon_2< Traits_P, Container_P >
Vertex_circulator typedef	CGAL::Polygon_2< Traits_P, Container_P >
Vertex_iterator typedef	CGAL::Polygon_2< Traits_P, Container_P >
Vertices typedef	CGAL::Polygon_2< Traits_P, Container_P >
vertices() const	CGAL::Polygon_2< Traits_P, Container_P >
vertices_begin() const	CGAL::Polygon_2< Traits_P, Container_P >
vertices_circulator() const	CGAL::Polygon_2< Traits_P, Container_P >
vertices_end() const	CGAL::Polygon_2< Traits_P, Container_P >