CGAL 6.1 - 2D Polygon Repair
|
Functions | |
template<class Kernel , class Container , class Rule = Even_odd_rule> | |
Multipolygon_with_holes_2< Kernel, Container > | CGAL::Polygon_repair::repair (const Polygon_2< Kernel, Container > &p, Rule=Rule()) |
repairs polygon p using the given rule | |
template<class Kernel , class Container , class Rule = Even_odd_rule> | |
Multipolygon_with_holes_2< Kernel, Container > | CGAL::Polygon_repair::repair (const Polygon_with_holes_2< Kernel, Container > &p, Rule=Rule()) |
repairs polygon with holes p using the given rule | |
template<class Kernel , class Container , class Rule = Even_odd_rule> | |
Multipolygon_with_holes_2< Kernel, Container > | CGAL::Polygon_repair::repair (const Multipolygon_with_holes_2< Kernel, Container > &p, Rule=Rule()) |
repairs multipolygon with holes p using the given rule | |
template<typename Kernel , typename Container > | |
Multipolygon_with_holes_2< Kernel, Container > | CGAL::Polygon_repair::join (const Multipolygon_with_holes_2< Kernel, Container > &pa) |
computes the union of all polygons with holes in p | |
template<typename PA , typename PB , typename Kernel = Default, typename Container = Default> | |
Multipolygon_with_holes_2< Kernel, Container > | CGAL::Polygon_repair::join (const PA &pa, const PB &pb, const Kernel &=Default(), const Container &=Default()) |
computes the union of two polygonal domains | |
template<typename Kernel , typename Container > | |
Multipolygon_with_holes_2< Kernel, Container > | CGAL::Polygon_repair::intersect (const Multipolygon_with_holes_2< Kernel, Container > &p) |
computes the intersection of all polygons with holes in p | |
template<typename PA , typename PB , typename Kernel = Default, typename Container = Default> | |
Multipolygon_with_holes_2< Kernel, Container > | CGAL::Polygon_repair::intersect (const PA &pa, const PB &pb, const Kernel &=Default(), const Container &=Default()) |
Computes the intersection of two polygonal domains. | |
Multipolygon_with_holes_2< Kernel, Container > CGAL::Polygon_repair::intersect | ( | const Multipolygon_with_holes_2< Kernel, Container > & | p | ) |
#include <CGAL/Polygon_repair/repair.h>
computes the intersection of all polygons with holes in p
Kernel | parameter of the input and output polygons. Must be model of ConstrainedDelaunayTriangulationTraits_2 |
Container | parameter of the input and output polygons |
Multipolygon_with_holes_2< Kernel, Container > CGAL::Polygon_repair::intersect | ( | const PA & | pa, |
const PB & | pb, | ||
const Kernel & | = Default() , |
||
const Container & | = Default() |
||
) |
#include <CGAL/Polygon_repair/repair.h>
Computes the intersection of two polygonal domains.
Kernel | parameter of the output polygon. Must be model of ConstrainedDelaunayTriangulationTraits_2 |
Container | parameter of the input and output polygons |
PA | must be Polygon_2<Kernel, Container> , or Polygon_with_holes_2<Kernel, Container> , or Multipolygon_with_holes_2<Kernel, Container> |
PB | must be Polygon_2<Kernel, Container> , or Polygon_with_holes_2<Kernel, Container> , or Multipolygon_with_holes_2<Kernel, Container> |
pa
and pb
must be free of self-intersections Multipolygon_with_holes_2< Kernel, Container > CGAL::Polygon_repair::join | ( | const Multipolygon_with_holes_2< Kernel, Container > & | pa | ) |
#include <CGAL/Polygon_repair/repair.h>
computes the union of all polygons with holes in p
Kernel | parameter of the input and output polygons. Must be model of ConstrainedDelaunayTriangulationTraits_2 |
Container | parameter of the input and output polygons |
Multipolygon_with_holes_2< Kernel, Container > CGAL::Polygon_repair::join | ( | const PA & | pa, |
const PB & | pb, | ||
const Kernel & | = Default() , |
||
const Container & | = Default() |
||
) |
#include <CGAL/Polygon_repair/repair.h>
computes the union of two polygonal domains
Kernel | parameter of the output polygons. Must be model of ConstrainedDelaunayTriangulationTraits_2 |
Container | parameter of the input and output polygons |
PA | must be Polygon_2<Kernel, Container> , or Polygon_with_holes_2<Kernel, Container> , or Multipolygon_with_holes_2<Kernel, Container> |
PB | must be Polygon_2<Kernel, Container> , or Polygon_with_holes_2<Kernel, Container> , or Multipolygon_with_holes_2<Kernel, Container> |
pa
and pb
must be free of self-intersections Multipolygon_with_holes_2< Kernel, Container > CGAL::Polygon_repair::repair | ( | const Multipolygon_with_holes_2< Kernel, Container > & | p, |
Rule | = Rule() |
||
) |
#include <CGAL/Polygon_repair/repair.h>
repairs multipolygon with holes p
using the given rule
Kernel | parameter of the input and output polygons. Must be model of ConstrainedDelaunayTriangulationTraits_2 |
Container | parameter of the input and output polygons |
Rule | may be any rule |
Union_rule
or Non_zero_rule
, each polygon with hole must be free of self-intersections Multipolygon_with_holes_2< Kernel, Container > CGAL::Polygon_repair::repair | ( | const Polygon_2< Kernel, Container > & | p, |
Rule | = Rule() |
||
) |
#include <CGAL/Polygon_repair/repair.h>
repairs polygon p
using the given rule
Kernel | parameter of the input and output polygons. Must be model of ConstrainedDelaunayTriangulationTraits_2 |
Container | parameter of the input and output polygons |
Rule | must be Even_odd_rule or Non_zero_rule |
Multipolygon_with_holes_2< Kernel, Container > CGAL::Polygon_repair::repair | ( | const Polygon_with_holes_2< Kernel, Container > & | p, |
Rule | = Rule() |
||
) |
#include <CGAL/Polygon_repair/repair.h>
repairs polygon with holes p
using the given rule
Kernel | parameter of the input and output polygons. Must be model of ConstrainedDelaunayTriangulationTraits_2 |
Container | parameter of the input and output polygons |
Rule | must be Even_odd_rule or Non_zero_rule |