\( \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.11 - 2D Regularized Boolean Set-Operations
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::General_polygon_set_2< Traits, Dcel > Member List

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

arrangement() const CGAL::General_polygon_set_2< Traits, Dcel >
Arrangement_2 typedefCGAL::General_polygon_set_2< Traits, Dcel >
clear()CGAL::General_polygon_set_2< Traits, Dcel >
complement()CGAL::General_polygon_set_2< Traits, Dcel >
complement(const Polygon_set_2 &other)CGAL::General_polygon_set_2< Traits, Dcel >
difference(const General_polygon_set_2 &other)CGAL::General_polygon_set_2< Traits, Dcel >
difference(const Polygon_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
difference(const Polygon_with_holes_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
difference(const General_polygon_set_2 &gps1, const General_polygon_set_2 &gps2)CGAL::General_polygon_set_2< Traits, Dcel >
do_intersect(const General_polygon_set_2 &other)CGAL::General_polygon_set_2< Traits, Dcel >
do_intersect(const Polygon_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
do_intersect(const Polygon_with_holes_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
do_intersect(InputIterator begin, InputIterator end)CGAL::General_polygon_set_2< Traits, Dcel >
do_intersect(InputIterator1 pgn_begin, InputIterator1 pgn_end, InputIterator2 pgn_with_holes_begin, InputIterator2 pgn_with_holes_end)CGAL::General_polygon_set_2< Traits, Dcel >
General_polygon_set_2()CGAL::General_polygon_set_2< Traits, Dcel >
General_polygon_set_2(const Self &other)CGAL::General_polygon_set_2< Traits, Dcel >
General_polygon_set_2(Traits &traits)CGAL::General_polygon_set_2< Traits, Dcel >
General_polygon_set_2(const Polygon_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
General_polygon_set_2(const Polygon_with_holes_2 &pgn_with_holes)CGAL::General_polygon_set_2< Traits, Dcel >
insert(Polygon_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
insert(Polygon_with_holes_2 &pgn_with_holes)CGAL::General_polygon_set_2< Traits, Dcel >
insert(InputIterator begin, InputIterator end)CGAL::General_polygon_set_2< Traits, Dcel >
insert(InputIterator1 pgn_begin, InputIterator1 pgn_end, InputIterator2 pgn_with_holes_begin, InputIterator2 pgn_with_holes_end)CGAL::General_polygon_set_2< Traits, Dcel >
intersection(const General_polygon_set_2 &other)CGAL::General_polygon_set_2< Traits, Dcel >
intersection(const Polygon_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
intersection(const Polygon_with_holes_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
intersection(InputIterator begin, InputIterator end)CGAL::General_polygon_set_2< Traits, Dcel >
intersection(InputIterator1 pgn_begin, InputIterator1 pgn_end, InputIterator2 pgn_with_holes_begin, InputIterator2 pgn_with_holes_end)CGAL::General_polygon_set_2< Traits, Dcel >
intersection(const General_polygon_set_2 &gps1, const General_polygon_set_2 &gps2)CGAL::General_polygon_set_2< Traits, Dcel >
is_empty() const CGAL::General_polygon_set_2< Traits, Dcel >
is_plane() const CGAL::General_polygon_set_2< Traits, Dcel >
is_valid() const CGAL::General_polygon_set_2< Traits, Dcel >
join(const General_polygon_set_2 &other)CGAL::General_polygon_set_2< Traits, Dcel >
join(const Polygon_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
join(const Polygon_with_holes_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
join(InputIterator begin, InputIterator end)CGAL::General_polygon_set_2< Traits, Dcel >
join(InputIterator1 pgn_begin, InputIterator1 pgn_end, InputIterator2 pgn_with_holes_begin, InputIterator2 pgn_with_holes_end)CGAL::General_polygon_set_2< Traits, Dcel >
join(const General_polygon_set_2 &gps1, const General_polygon_set_2 &gps2)CGAL::General_polygon_set_2< Traits, Dcel >
locate(const Point_2 &p, Polygon_with_holes_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
number_of_polygons_with_holes() const CGAL::General_polygon_set_2< Traits, Dcel >
oriented_side(const Point_2 &q)CGAL::General_polygon_set_2< Traits, Dcel >
oriented_side(const General_polygon_set_2 &other)CGAL::General_polygon_set_2< Traits, Dcel >
oriented_side(const Polygon_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
oriented_side(const Polygon_with_holes_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
Polygon_2 typedefCGAL::General_polygon_set_2< Traits, Dcel >
Polygon_with_holes_2 typedefCGAL::General_polygon_set_2< Traits, Dcel >
polygons_with_holes(OutputIterator out)CGAL::General_polygon_set_2< Traits, Dcel >
Size typedefCGAL::General_polygon_set_2< Traits, Dcel >
symmetric_difference(const General_polygon_set_2 &other)CGAL::General_polygon_set_2< Traits, Dcel >
symmetric_difference(const Polygon_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
symmetric_difference(const Polygon_with_holes_2 &pgn)CGAL::General_polygon_set_2< Traits, Dcel >
symmetric_difference(InputIterator begin, InputIterator end)CGAL::General_polygon_set_2< Traits, Dcel >
symmetric_difference(InputIterator1 pgn_begin, InputIterator1 pgn_end, InputIterator2 pgn_with_holes_begin, InputIterator2 pgn_with_holes_end)CGAL::General_polygon_set_2< Traits, Dcel >
symmetric_difference(const General_polygon_set_2 &gps1, const General_polygon_set_2 &gps2)CGAL::General_polygon_set_2< Traits, Dcel >
traits() const CGAL::General_polygon_set_2< Traits, Dcel >
Traits_2 typedefCGAL::General_polygon_set_2< Traits, Dcel >