BWAPI
|
#include <set>
#include <CGAL/triangulation_assertions.h>
#include <CGAL/Triangulation_2.h>
#include <CGAL/Constrained_triangulation_face_base_2.h>
#include <CGAL/iterator.h>
#include <CGAL/intersections.h>
#include <CGAL/squared_distance_2.h>
Go to the source code of this file.
Classes | |
struct | No_intersection_tag |
struct | Exact_intersections_tag |
struct | Exact_predicates_tag |
class | Constrained_triangulation_2< Gt, Tds, Itag > |
class | Constrained_triangulation_2< Gt, Tds, Itag >::Less_edge |
Functions | |
template<class Gt , class Tds , class Itag > | |
std::ostream & | operator<< (std::ostream &os, const Constrained_triangulation_2< Gt, Tds, Itag > &ct) |
template<class Gt > | |
bool | intersection (Gt, const typename Gt::Point_2 &, const typename Gt::Point_2 &, const typename Gt::Point_2 &, const typename Gt::Point_2 &, typename Gt::Point_2 &, No_intersection_tag) |
template<class Gt > | |
bool | intersection (Gt gt, const typename Gt::Point_2 &pa, const typename Gt::Point_2 &pb, const typename Gt::Point_2 &pc, const typename Gt::Point_2 &pd, typename Gt::Point_2 &pi, Exact_intersections_tag) |
template<class Gt > | |
bool | intersection (Gt gt, const typename Gt::Point_2 &pa, const typename Gt::Point_2 &pb, const typename Gt::Point_2 &pc, const typename Gt::Point_2 &pd, typename Gt::Point_2 &pi, Exact_predicates_tag) |
template<class Gt > | |
bool | compute_intersection (Gt gt, const typename Gt::Point_2 &pa, const typename Gt::Point_2 &pb, const typename Gt::Point_2 &pc, const typename Gt::Point_2 &pd, typename Gt::Point_2 &pi) |
template<class Gt > | |
int | limit_intersection (Gt, const typename Gt::Point_2 &, const typename Gt::Point_2 &, const typename Gt::Point_2 &, const typename Gt::Point_2 &, No_intersection_tag) |
template<class Gt > | |
int | limit_intersection (Gt, const typename Gt::Point_2 &, const typename Gt::Point_2 &, const typename Gt::Point_2 &, const typename Gt::Point_2 &, Exact_intersections_tag) |
template<class Gt > | |
int | limit_intersection (Gt gt, const typename Gt::Point_2 &pa, const typename Gt::Point_2 &pb, const typename Gt::Point_2 &pc, const typename Gt::Point_2 &pd, Exact_predicates_tag) |
bool compute_intersection | ( | Gt | gt, |
const typename Gt::Point_2 & | pa, | ||
const typename Gt::Point_2 & | pb, | ||
const typename Gt::Point_2 & | pc, | ||
const typename Gt::Point_2 & | pd, | ||
typename Gt::Point_2 & | pi | ||
) |
bool intersection | ( | Gt | , |
const typename Gt::Point_2 & | , | ||
const typename Gt::Point_2 & | , | ||
const typename Gt::Point_2 & | , | ||
const typename Gt::Point_2 & | , | ||
typename Gt::Point_2 & | , | ||
No_intersection_tag | |||
) |
bool intersection | ( | Gt | gt, |
const typename Gt::Point_2 & | pa, | ||
const typename Gt::Point_2 & | pb, | ||
const typename Gt::Point_2 & | pc, | ||
const typename Gt::Point_2 & | pd, | ||
typename Gt::Point_2 & | pi, | ||
Exact_intersections_tag | |||
) |
bool intersection | ( | Gt | gt, |
const typename Gt::Point_2 & | pa, | ||
const typename Gt::Point_2 & | pb, | ||
const typename Gt::Point_2 & | pc, | ||
const typename Gt::Point_2 & | pd, | ||
typename Gt::Point_2 & | pi, | ||
Exact_predicates_tag | |||
) | [inline] |
int limit_intersection | ( | Gt | , |
const typename Gt::Point_2 & | , | ||
const typename Gt::Point_2 & | , | ||
const typename Gt::Point_2 & | , | ||
const typename Gt::Point_2 & | , | ||
No_intersection_tag | |||
) |
int limit_intersection | ( | Gt | , |
const typename Gt::Point_2 & | , | ||
const typename Gt::Point_2 & | , | ||
const typename Gt::Point_2 & | , | ||
const typename Gt::Point_2 & | , | ||
Exact_intersections_tag | |||
) |
int limit_intersection | ( | Gt | gt, |
const typename Gt::Point_2 & | pa, | ||
const typename Gt::Point_2 & | pb, | ||
const typename Gt::Point_2 & | pc, | ||
const typename Gt::Point_2 & | pd, | ||
Exact_predicates_tag | |||
) |
std::ostream& operator<< | ( | std::ostream & | os, |
const Constrained_triangulation_2< Gt, Tds, Itag > & | ct | ||
) |