CGAL 4.7 - 2D Regularized Boolean Set-Operations: Member List

\( \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.7 - 2D Regularized Boolean Set-Operations

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Polygon_set_2< Kernel, Container, Dcel > Member List

This is the complete list of members for CGAL::Polygon_set_2< Kernel, Container, Dcel >, including all inherited members.

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