mirror of https://github.com/CGAL/cgal
A first step towards the extendible Kernel:
* All functionality is moved into namespace CGALi, in namespace CGAL there remain forward functions for the geometric types from the CGAL kernel thereby fully maintaining backwards compatibility; nothing changes on the user level. * In the CGALi part, all types are referred to as K::Type rather than Type<K>. * In the CGALi part, all functions have a kernel object as last argument, not only to ease the matching (no explicit template argument needed), but also to be able to handle kernels with state.
This commit is contained in:
Michael Hoffmann
parent
1d5124e842
commit
ce7a355471
|
|
@ -1,3 +1,18 @@
|
|||
2.7 (7 August 2003)
|
||||
A first step towards the extendible Kernel:
|
||||
|
||||
* All functionality is moved into namespace CGALi, in namespace CGAL
|
||||
there remain forward functions for the geometric types from the CGAL
|
||||
kernel thereby fully maintaining backwards compatibility; nothing
|
||||
changes on the user level.
|
||||
|
||||
* In the CGALi part, all types are referred to as K::Type rather than
|
||||
Type<K>.
|
||||
|
||||
* In the CGALi part, all functions have a kernel object as last
|
||||
argument, not only to ease the matching (no explicit template
|
||||
argument needed), but also to be able to handle kernels with state.
|
||||
|
||||
2.6 (4 April 2003)
|
||||
- reflected the changes of 2.5.7 in web directory
|
||||
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
|
|
@ -38,452 +38,530 @@
|
|||
|
||||
CGAL_BEGIN_NAMESPACE
|
||||
|
||||
namespace CGALi {
|
||||
|
||||
|
||||
|
||||
template <class R>
|
||||
extern void
|
||||
distance_index(
|
||||
int &ind1,
|
||||
int &ind2,
|
||||
const Point_2<R> &pt,
|
||||
const Triangle_2<R> &triangle)
|
||||
{
|
||||
const Point_2<R> &vt0 = triangle.vertex(0);
|
||||
const Point_2<R> &vt1 = triangle.vertex(1);
|
||||
const Point_2<R> &vt2 = triangle.vertex(2);
|
||||
template <class K>
|
||||
extern void
|
||||
distance_index(int &ind1,
|
||||
int &ind2,
|
||||
const typename CGAL_WRAP(K)::Point_2 &pt,
|
||||
const typename CGAL_WRAP(K)::Triangle_2 &triangle)
|
||||
{
|
||||
typedef typename K::Point_2 Point_2;
|
||||
const Point_2 &vt0 = triangle.vertex(0);
|
||||
const Point_2 &vt1 = triangle.vertex(1);
|
||||
const Point_2 &vt2 = triangle.vertex(2);
|
||||
if (left_turn(vt0, vt1, vt2)) {
|
||||
if (right_turn(vt0, vt1, pt)) {
|
||||
if (!is_acute_angle(vt0, vt1, pt)) {
|
||||
if (right_turn(vt1, vt2, pt)) {
|
||||
if (!is_acute_angle(vt1, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 2;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt0, pt)) {
|
||||
if (right_turn(vt2, vt0, pt)) {
|
||||
if (!is_acute_angle(vt0, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 0;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = 1;
|
||||
return;
|
||||
} else {
|
||||
if (right_turn(vt1, vt2, pt)) {
|
||||
if (!is_acute_angle(vt1, vt2, pt)) {
|
||||
if (right_turn(vt2, vt0, pt)) {
|
||||
if (!is_acute_angle(vt0, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 0;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 2;
|
||||
return;
|
||||
} else {
|
||||
if (right_turn(vt2, vt0, pt)) {
|
||||
if (!is_acute_angle(vt2, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt0, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 0;
|
||||
return;
|
||||
} else {
|
||||
ind1 = -1; ind2 = -1; // point inside or on boundary.
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (right_turn(vt0, vt1, pt)) {
|
||||
if (!is_acute_angle(vt0, vt1, pt)) {
|
||||
if (right_turn(vt1, vt2, pt)) {
|
||||
if (!is_acute_angle(vt1, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 2;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt0, pt)) {
|
||||
if (right_turn(vt2, vt0, pt)) {
|
||||
if (!is_acute_angle(vt0, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 0;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = 1;
|
||||
return;
|
||||
} else {
|
||||
if (right_turn(vt1, vt2, pt)) {
|
||||
if (!is_acute_angle(vt1, vt2, pt)) {
|
||||
if (right_turn(vt2, vt0, pt)) {
|
||||
if (!is_acute_angle(vt0, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 0;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 2;
|
||||
return;
|
||||
} else {
|
||||
if (right_turn(vt2, vt0, pt)) {
|
||||
if (!is_acute_angle(vt2, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt0, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 0;
|
||||
return;
|
||||
} else {
|
||||
ind1 = -1; ind2 = -1; // point inside or on boundary.
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
} else {
|
||||
if (right_turn(vt0, vt2, pt)) {
|
||||
if (!is_acute_angle(vt0, vt2, pt)) {
|
||||
if (right_turn(vt2, vt1, pt)) {
|
||||
if (!is_acute_angle(vt2, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt0, pt)) {
|
||||
if (right_turn(vt1, vt0, pt)) {
|
||||
if (!is_acute_angle(vt0, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 0;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = 2;
|
||||
return;
|
||||
} else {
|
||||
if (right_turn(vt2, vt1, pt)) {
|
||||
if (!is_acute_angle(vt2, vt1, pt)) {
|
||||
if (right_turn(vt1, vt0, pt)) {
|
||||
if (!is_acute_angle(vt0, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 0;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 1;
|
||||
return;
|
||||
} else {
|
||||
if (right_turn(vt1, vt0, pt)) {
|
||||
if (!is_acute_angle(vt1, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt0, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 0;
|
||||
return;
|
||||
} else {
|
||||
ind1 = -1; ind2 = -1; // point inside or on boundary.
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (right_turn(vt0, vt2, pt)) {
|
||||
if (!is_acute_angle(vt0, vt2, pt)) {
|
||||
if (right_turn(vt2, vt1, pt)) {
|
||||
if (!is_acute_angle(vt2, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt2, vt0, pt)) {
|
||||
if (right_turn(vt1, vt0, pt)) {
|
||||
if (!is_acute_angle(vt0, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 0;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = 2;
|
||||
return;
|
||||
} else {
|
||||
if (right_turn(vt2, vt1, pt)) {
|
||||
if (!is_acute_angle(vt2, vt1, pt)) {
|
||||
if (right_turn(vt1, vt0, pt)) {
|
||||
if (!is_acute_angle(vt0, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 0;
|
||||
return;
|
||||
}
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt1, vt2, pt)) {
|
||||
ind1 = 2; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 2; ind2 = 1;
|
||||
return;
|
||||
} else {
|
||||
if (right_turn(vt1, vt0, pt)) {
|
||||
if (!is_acute_angle(vt1, vt0, pt)) {
|
||||
ind1 = 0; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
if (!is_acute_angle(vt0, vt1, pt)) {
|
||||
ind1 = 1; ind2 = -1;
|
||||
return;
|
||||
}
|
||||
ind1 = 1; ind2 = 0;
|
||||
return;
|
||||
} else {
|
||||
ind1 = -1; ind2 = -1; // point inside or on boundary.
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
template <class R>
|
||||
extern typename R::FT
|
||||
squared_distance_indexed(const Point_2<R> &pt,
|
||||
const Triangle_2<R> &triangle, int ind1, int ind2)
|
||||
{
|
||||
typedef typename R::FT FT;
|
||||
template <class K>
|
||||
extern typename K::FT
|
||||
squared_distance_indexed(const typename CGAL_WRAP(K)::Point_2 &pt,
|
||||
const typename CGAL_WRAP(K)::Triangle_2 &triangle,
|
||||
int ind1, int ind2,
|
||||
const K& k)
|
||||
{
|
||||
typedef typename K::FT FT;
|
||||
typedef typename K::Line_2 Line_2;
|
||||
if (ind1 == -1)
|
||||
return FT(0);
|
||||
return FT(0);
|
||||
if (ind2 == -1)
|
||||
return squared_distance(pt, triangle.vertex(ind1));
|
||||
return squared_distance(pt,
|
||||
Line_2<R>(triangle.vertex(ind1), triangle.vertex(ind2)));
|
||||
}
|
||||
return CGALi::squared_distance(pt, triangle.vertex(ind1), k);
|
||||
return CGALi::squared_distance(pt,
|
||||
Line_2(triangle.vertex(ind1), triangle.vertex(ind2)),
|
||||
k);
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <class R>
|
||||
extern typename R::FT
|
||||
squared_distance(
|
||||
const Point_2<R> &pt,
|
||||
const Triangle_2<R> &triangle)
|
||||
{
|
||||
template <class K>
|
||||
extern typename K::FT
|
||||
squared_distance(const typename CGAL_WRAP(K)::Point_2 &pt,
|
||||
const typename CGAL_WRAP(K)::Triangle_2 &triangle,
|
||||
const K& k)
|
||||
{
|
||||
int ind1,ind2;
|
||||
distance_index(ind1, ind2, pt, triangle);
|
||||
return squared_distance_indexed(pt, triangle, ind1, ind2);
|
||||
}
|
||||
distance_index<K>(ind1, ind2, pt, triangle);
|
||||
return squared_distance_indexed(pt, triangle, ind1, ind2, k);
|
||||
}
|
||||
|
||||
|
||||
template <class R>
|
||||
inline typename R::FT
|
||||
squared_distance(
|
||||
const Triangle_2<R> & triangle,
|
||||
const Point_2<R> & pt)
|
||||
{
|
||||
return squared_distance(pt, triangle);
|
||||
}
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const typename CGAL_WRAP(K)::Triangle_2 & triangle,
|
||||
const typename CGAL_WRAP(K)::Point_2 & pt,
|
||||
const K& k)
|
||||
{
|
||||
return CGALi::squared_distance(pt, triangle, k);
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <class R>
|
||||
extern typename R::FT
|
||||
squared_distance(
|
||||
const Line_2<R> &line,
|
||||
const Triangle_2<R> &triangle)
|
||||
{
|
||||
typedef typename R::FT FT;
|
||||
template <class K>
|
||||
extern typename K::FT
|
||||
squared_distance(const typename CGAL_WRAP(K)::Line_2 &line,
|
||||
const typename CGAL_WRAP(K)::Triangle_2 &triangle,
|
||||
const K& k)
|
||||
{
|
||||
typedef typename K::FT FT;
|
||||
Oriented_side side0;
|
||||
side0 = line.oriented_side(triangle.vertex(0));
|
||||
if (line.oriented_side(triangle.vertex(1)) != side0)
|
||||
return FT(0);
|
||||
return FT(0);
|
||||
if (line.oriented_side(triangle.vertex(2)) != side0)
|
||||
return FT(0);
|
||||
return FT(0);
|
||||
FT mindist, dist;
|
||||
int i;
|
||||
mindist = squared_distance(triangle.vertex(0),line);
|
||||
mindist = CGALi::squared_distance(triangle.vertex(0),line,k);
|
||||
for (i=1; i<3; i++) {
|
||||
dist = squared_distance(triangle.vertex(i),line);
|
||||
if (dist < mindist)
|
||||
mindist = dist;
|
||||
dist = CGALi::squared_distance(triangle.vertex(i),line,k);
|
||||
if (dist < mindist)
|
||||
mindist = dist;
|
||||
}
|
||||
return mindist;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
template <class R>
|
||||
inline typename R::FT
|
||||
squared_distance(
|
||||
const Triangle_2<R> & triangle,
|
||||
const Line_2<R> & line)
|
||||
{
|
||||
return squared_distance(line, triangle);
|
||||
}
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const typename CGAL_WRAP(K)::Triangle_2 & triangle,
|
||||
const typename CGAL_WRAP(K)::Line_2 & line,
|
||||
const K& k)
|
||||
{
|
||||
return CGALi::squared_distance(line, triangle, k);
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <class R>
|
||||
extern typename R::FT
|
||||
squared_distance(
|
||||
const Ray_2<R> &ray,
|
||||
const Triangle_2<R> &triangle)
|
||||
{
|
||||
typedef typename R::FT FT;
|
||||
template <class K>
|
||||
extern typename K::FT
|
||||
squared_distance(const typename CGAL_WRAP(K)::Ray_2 &ray,
|
||||
const typename CGAL_WRAP(K)::Triangle_2 &triangle,
|
||||
const K& k)
|
||||
{
|
||||
typedef typename K::FT FT;
|
||||
typedef typename K::Point_2 Point_2;
|
||||
typedef typename K::Line_2 Line_2;
|
||||
int i, ind_tr1, ind_tr2, ind_ray = 0, ind1;
|
||||
FT mindist, dist;
|
||||
distance_index(ind_tr1, ind_tr2, ray.source(), triangle);
|
||||
distance_index<K>(ind_tr1, ind_tr2, ray.source(), triangle);
|
||||
mindist =
|
||||
squared_distance_indexed(ray.source(), triangle, ind_tr1,ind_tr2);
|
||||
squared_distance_indexed(ray.source(), triangle, ind_tr1, ind_tr2, k);
|
||||
for (i=0; i<3; i++) {
|
||||
const Point_2<R>& pt = triangle.vertex(i);
|
||||
distance_index(ind1, pt, ray);
|
||||
dist = squared_distance_indexed(pt, ray, ind1);
|
||||
if (dist < mindist) {
|
||||
ind_ray = ind1;
|
||||
ind_tr1 = i; ind_tr2 = -1;
|
||||
mindist = dist;
|
||||
}
|
||||
const Point_2& pt = triangle.vertex(i);
|
||||
distance_index<K>(ind1, pt, ray);
|
||||
dist = squared_distance_indexed(pt, ray, ind1, k);
|
||||
if (dist < mindist) {
|
||||
ind_ray = ind1;
|
||||
ind_tr1 = i; ind_tr2 = -1;
|
||||
mindist = dist;
|
||||
}
|
||||
}
|
||||
// now check if all vertices are on the right side of the separating line.
|
||||
// In case of vertex-vertex smallest distance this is the case.
|
||||
if (ind_tr2 == -1 && ind_ray != -1)
|
||||
return mindist;
|
||||
return mindist;
|
||||
if (ind_tr2 != -1) {
|
||||
// Check if all the segment vertices lie at the same side of
|
||||
// the triangle segment.
|
||||
const Point_2<R> &vt1 = triangle.vertex(ind_tr1);
|
||||
const Point_2<R> &vt2 = triangle.vertex(ind_tr2);
|
||||
if (clockwise(ray.direction().vector(), vt2-vt1)) {
|
||||
mindist = FT(0);
|
||||
}
|
||||
// Check if all the segment vertices lie at the same side of
|
||||
// the triangle segment.
|
||||
const Point_2 &vt1 = triangle.vertex(ind_tr1);
|
||||
const Point_2 &vt2 = triangle.vertex(ind_tr2);
|
||||
if (clockwise(ray.direction().vector(), vt2-vt1)) {
|
||||
mindist = FT(0);
|
||||
}
|
||||
} else {
|
||||
// Check if all the triangle vertices lie at the same side of the segment.
|
||||
const Line_2<R> &sl = ray.supporting_line();
|
||||
Oriented_side or_s = sl.oriented_side(triangle.vertex(0));
|
||||
for (i=1; i<3; i++) {
|
||||
if (sl.oriented_side(triangle.vertex(i)) != or_s) {
|
||||
mindist = FT(0);
|
||||
break;
|
||||
}
|
||||
}
|
||||
// Check if all the triangle vertices lie
|
||||
// at the same side of the segment.
|
||||
const Line_2 &sl = ray.supporting_line();
|
||||
Oriented_side or_s = sl.oriented_side(triangle.vertex(0));
|
||||
for (i=1; i<3; i++) {
|
||||
if (sl.oriented_side(triangle.vertex(i)) != or_s) {
|
||||
mindist = FT(0);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
return mindist;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
template <class R>
|
||||
inline typename R::FT
|
||||
squared_distance(
|
||||
const Triangle_2<R> & triangle,
|
||||
const Ray_2<R> & ray)
|
||||
{
|
||||
return squared_distance(ray, triangle);
|
||||
}
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const typename CGAL_WRAP(K)::Triangle_2 & triangle,
|
||||
const typename CGAL_WRAP(K)::Ray_2 & ray,
|
||||
const K& k)
|
||||
{
|
||||
return CGALi::squared_distance(ray, triangle, k);
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <class R>
|
||||
extern typename R::FT
|
||||
squared_distance(
|
||||
const Segment_2<R> &seg,
|
||||
const Triangle_2<R> &triangle)
|
||||
{
|
||||
typedef typename R::FT FT;
|
||||
template <class K>
|
||||
extern typename K::FT
|
||||
squared_distance(const typename CGAL_WRAP(K)::Segment_2 &seg,
|
||||
const typename CGAL_WRAP(K)::Triangle_2 &triangle,
|
||||
const K& k)
|
||||
{
|
||||
typedef typename K::FT FT;
|
||||
typedef typename K::Point_2 Point_2;
|
||||
int i, ind_tr1 = 0, ind_tr2 = -1, ind_seg = 0, ind1, ind2;
|
||||
FT mindist, dist;
|
||||
mindist = squared_distance(seg.source(), triangle.vertex(0));
|
||||
mindist = CGALi::squared_distance(seg.source(), triangle.vertex(0), k);
|
||||
for (i=0; i<2; i++) {
|
||||
const Point_2<R> &pt = seg.vertex(i);
|
||||
distance_index(ind1, ind2, pt, triangle);
|
||||
dist = squared_distance_indexed(pt, triangle, ind1, ind2);
|
||||
if (dist < mindist) {
|
||||
ind_seg = i;
|
||||
ind_tr1 = ind1; ind_tr2 = ind2;
|
||||
mindist = dist;
|
||||
}
|
||||
const Point_2 &pt = seg.vertex(i);
|
||||
distance_index<K>(ind1, ind2, pt, triangle);
|
||||
dist = CGALi::squared_distance_indexed(pt, triangle, ind1, ind2, k);
|
||||
if (dist < mindist) {
|
||||
ind_seg = i;
|
||||
ind_tr1 = ind1; ind_tr2 = ind2;
|
||||
mindist = dist;
|
||||
}
|
||||
}
|
||||
for (i=0; i<3; i++) {
|
||||
const Point_2<R>& pt = triangle.vertex(i);
|
||||
distance_index(ind1, pt, seg);
|
||||
dist = squared_distance_indexed(pt, seg, ind1);
|
||||
if (dist < mindist) {
|
||||
ind_seg = ind1;
|
||||
ind_tr1 = i; ind_tr2 = -1;
|
||||
mindist = dist;
|
||||
}
|
||||
const Point_2& pt = triangle.vertex(i);
|
||||
distance_index<K>(ind1, pt, seg);
|
||||
dist = CGALi::squared_distance_indexed(pt, seg, ind1, k);
|
||||
if (dist < mindist) {
|
||||
ind_seg = ind1;
|
||||
ind_tr1 = i; ind_tr2 = -1;
|
||||
mindist = dist;
|
||||
}
|
||||
}
|
||||
// now check if all vertices are on the right side of the separating line.
|
||||
// In case of vertex-vertex smallest distance this is the case.
|
||||
if (ind_tr2 == -1 && ind_seg != -1)
|
||||
return mindist;
|
||||
return mindist;
|
||||
|
||||
if (ind_tr2 != -1) {
|
||||
// Check if all the segment vertices lie at the same side of
|
||||
// the triangle segment.
|
||||
const Point_2<R> &vt1 = triangle.vertex(ind_tr1);
|
||||
const Point_2<R> &vt2 = triangle.vertex(ind_tr2);
|
||||
Orientation or_s = orientation(vt1, vt2, seg.source());
|
||||
if (orientation(vt1, vt2, seg.target()) != or_s) {
|
||||
mindist = FT(0);
|
||||
}
|
||||
// Check if all the segment vertices lie at the same side of
|
||||
// the triangle segment.
|
||||
const Point_2 &vt1 = triangle.vertex(ind_tr1);
|
||||
const Point_2 &vt2 = triangle.vertex(ind_tr2);
|
||||
Orientation or_s = orientation(vt1, vt2, seg.source());
|
||||
if (orientation(vt1, vt2, seg.target()) != or_s) {
|
||||
mindist = FT(0);
|
||||
}
|
||||
} else {
|
||||
// Check if all the triangle vertices lie at the same side of the segment.
|
||||
const Point_2<R> &vt1 = seg.source();
|
||||
const Point_2<R> &vt2 = seg.target();
|
||||
Orientation or_s = orientation(vt1, vt2, triangle.vertex(0));
|
||||
for (i=1; i<3; i++) {
|
||||
if (orientation(vt1, vt2, triangle.vertex(i)) != or_s) {
|
||||
mindist = FT(0);
|
||||
break;
|
||||
}
|
||||
}
|
||||
// Check if all the triangle vertices lie
|
||||
// at the same side of the segment.
|
||||
const Point_2 &vt1 = seg.source();
|
||||
const Point_2 &vt2 = seg.target();
|
||||
Orientation or_s = orientation(vt1, vt2, triangle.vertex(0));
|
||||
for (i=1; i<3; i++) {
|
||||
if (orientation(vt1, vt2, triangle.vertex(i)) != or_s) {
|
||||
mindist = FT(0);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
return mindist;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
template <class R>
|
||||
inline typename R::FT
|
||||
squared_distance(
|
||||
const Triangle_2<R> & triangle,
|
||||
const Segment_2<R> & seg)
|
||||
{
|
||||
return squared_distance(seg, triangle);
|
||||
}
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const typename CGAL_WRAP(K)::Triangle_2 & triangle,
|
||||
const typename CGAL_WRAP(K)::Segment_2 & seg,
|
||||
const K& k)
|
||||
{
|
||||
return CGALi::squared_distance(seg, triangle, k);
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <class R>
|
||||
extern typename R::FT
|
||||
squared_distance(
|
||||
const Triangle_2<R> &triangle1,
|
||||
const Triangle_2<R> &triangle2)
|
||||
{
|
||||
typedef typename R::FT FT;
|
||||
template <class K>
|
||||
extern typename K::FT
|
||||
squared_distance(const typename CGAL_WRAP(K)::Triangle_2 &triangle1,
|
||||
const typename CGAL_WRAP(K)::Triangle_2 &triangle2,
|
||||
const K& k)
|
||||
{
|
||||
typedef typename K::FT FT;
|
||||
typedef typename K::Point_2 Point_2;
|
||||
int i, ind1_1 = 0,ind1_2 = -1, ind2_1 = 0, ind2_2 = -1, ind1, ind2;
|
||||
FT mindist, dist;
|
||||
mindist =
|
||||
squared_distance(triangle1.vertex(0), triangle2.vertex(0));
|
||||
CGALi::squared_distance(triangle1.vertex(0), triangle2.vertex(0), k);
|
||||
for (i=0; i<3; i++) {
|
||||
const Point_2<R>& pt = triangle1.vertex(i);
|
||||
distance_index(ind1, ind2, pt, triangle2);
|
||||
dist = squared_distance_indexed(pt, triangle2, ind1, ind2);
|
||||
if (dist < mindist) {
|
||||
ind1_1 = i; ind1_2 = -1;
|
||||
ind2_1 = ind1; ind2_2 = ind2;
|
||||
mindist = dist;
|
||||
}
|
||||
const Point_2& pt = triangle1.vertex(i);
|
||||
distance_index<K>(ind1, ind2, pt, triangle2);
|
||||
dist = squared_distance_indexed(pt, triangle2, ind1, ind2, k);
|
||||
if (dist < mindist) {
|
||||
ind1_1 = i; ind1_2 = -1;
|
||||
ind2_1 = ind1; ind2_2 = ind2;
|
||||
mindist = dist;
|
||||
}
|
||||
}
|
||||
for (i=0; i<3; i++) {
|
||||
const Point_2<R>& pt = triangle2.vertex(i);
|
||||
distance_index(ind1, ind2, pt, triangle1);
|
||||
dist = squared_distance_indexed(pt, triangle1, ind1, ind2);
|
||||
if (dist < mindist) {
|
||||
ind1_1 = ind1; ind1_2 = ind2;
|
||||
ind2_1 = i; ind2_2 = -1;
|
||||
mindist = dist;
|
||||
}
|
||||
const Point_2& pt = triangle2.vertex(i);
|
||||
distance_index<K>(ind1, ind2, pt, triangle1);
|
||||
dist = squared_distance_indexed(pt, triangle1, ind1, ind2, k);
|
||||
if (dist < mindist) {
|
||||
ind1_1 = ind1; ind1_2 = ind2;
|
||||
ind2_1 = i; ind2_2 = -1;
|
||||
mindist = dist;
|
||||
}
|
||||
}
|
||||
// now check if all vertices are on the right side of the separating line.
|
||||
// now check if all vertices are on the right side of the
|
||||
// separating line.
|
||||
if (ind1_2 == -1 && ind2_2 == -1)
|
||||
return mindist;
|
||||
// In case of point-segment closest distance, there is still the possibility
|
||||
// of overlapping triangles.
|
||||
// Check if all the vertices lie at the same side of the segment.
|
||||
return mindist;
|
||||
// In case of point-segment closest distance, there is still the
|
||||
// possibility of overlapping triangles. Check if all the
|
||||
// vertices lie at the same side of the segment.
|
||||
if (ind1_2 != -1) {
|
||||
const Point_2<R> &vt1 = triangle1.vertex(ind1_1);
|
||||
const Point_2<R> &vt2 = triangle1.vertex(ind1_2);
|
||||
Orientation or_s = orientation(vt1, vt2, triangle2.vertex(0));
|
||||
for (i=1; i<3; i++) {
|
||||
if (orientation(vt1, vt2, triangle2.vertex(i)) != or_s) {
|
||||
mindist = FT(0);
|
||||
break;
|
||||
}
|
||||
}
|
||||
const Point_2 &vt1 = triangle1.vertex(ind1_1);
|
||||
const Point_2 &vt2 = triangle1.vertex(ind1_2);
|
||||
Orientation or_s = orientation(vt1, vt2, triangle2.vertex(0));
|
||||
for (i=1; i<3; i++) {
|
||||
if (orientation(vt1, vt2, triangle2.vertex(i)) != or_s) {
|
||||
mindist = FT(0);
|
||||
break;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
const Point_2<R> &vt1 = triangle2.vertex(ind2_1);
|
||||
const Point_2<R> &vt2 = triangle2.vertex(ind2_2);
|
||||
Orientation or_s = orientation(vt1, vt2, triangle1.vertex(0));
|
||||
for (i=1; i<3; i++) {
|
||||
if (orientation(vt1, vt2, triangle1.vertex(i)) != or_s) {
|
||||
mindist = FT(0);
|
||||
break;
|
||||
}
|
||||
}
|
||||
const Point_2 &vt1 = triangle2.vertex(ind2_1);
|
||||
const Point_2 &vt2 = triangle2.vertex(ind2_2);
|
||||
Orientation or_s = orientation(vt1, vt2, triangle1.vertex(0));
|
||||
for (i=1; i<3; i++) {
|
||||
if (orientation(vt1, vt2, triangle1.vertex(i)) != or_s) {
|
||||
mindist = FT(0);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
return mindist;
|
||||
}
|
||||
|
||||
} // namespace CGALi
|
||||
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const Point_2<K> &pt,
|
||||
const Triangle_2<K> &triangle)
|
||||
{
|
||||
return CGALi::squared_distance(pt, triangle, K());
|
||||
}
|
||||
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const Triangle_2<K> &triangle,
|
||||
const Point_2<K> &pt)
|
||||
{
|
||||
return CGALi::squared_distance(pt, triangle, K());
|
||||
}
|
||||
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const Line_2<K> &line,
|
||||
const Triangle_2<K> &triangle)
|
||||
{
|
||||
return CGALi::squared_distance(line, triangle, K());
|
||||
}
|
||||
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const Triangle_2<K> &triangle,
|
||||
const Line_2<K> &line)
|
||||
{
|
||||
return CGALi::squared_distance(line, triangle, K());
|
||||
}
|
||||
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const Ray_2<K> &ray,
|
||||
const Triangle_2<K> &triangle)
|
||||
{
|
||||
return CGALi::squared_distance(ray, triangle, K());
|
||||
}
|
||||
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const Triangle_2<K> &triangle,
|
||||
const Ray_2<K> &ray)
|
||||
{
|
||||
return CGALi::squared_distance(ray, triangle, K());
|
||||
}
|
||||
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const Segment_2<K> &seg,
|
||||
const Triangle_2<K> &triangle)
|
||||
{
|
||||
return CGALi::squared_distance(seg, triangle, K());
|
||||
}
|
||||
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const Triangle_2<K> &triangle,
|
||||
const Segment_2<K> &seg)
|
||||
{
|
||||
return CGALi::squared_distance(seg, triangle, K());
|
||||
}
|
||||
|
||||
template <class K>
|
||||
inline typename K::FT
|
||||
squared_distance(const Triangle_2<K> &triangle1,
|
||||
const Triangle_2<K> &triangle2)
|
||||
{
|
||||
return CGALi::squared_distance(triangle1, triangle2, K());
|
||||
}
|
||||
|
||||
CGAL_END_NAMESPACE
|
||||
|
||||
|
||||
#endif
|
||||
|
|
|
|||
Loading…
Reference in New Issue