1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
// Copyright (c) 2002 Max-Planck-Institute Saarbruecken (Germany).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// You can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/next/Convex_hull_2/include/CGAL/ch_function_objects_2.h $
// $Id: ch_function_objects_2.h 67117 2012-01-13 18:14:48Z lrineau $
//
//
// Author(s) : Susan Hert
#ifndef CGAL_CH_FUNCTION_OBJECTS_2_H
#define CGAL_CH_FUNCTION_OBJECTS_2_H
namespace CGAL {
namespace internal {
template <class R>
class r_Less_dist_to_line
{
public:
typedef bool result_type;
typedef typename R::Point_2 Point;
typedef typename R::Line_2 Line;
r_Less_dist_to_line() : line_constructed( false )
{ }
bool operator()(const Point& a, const Point& b,
const Point& c, const Point& d) const
{
if (!line_constructed)
{
line_constructed = true;
l_ab = Line(a,b);
}
Comparison_result res = compare_signed_distance_to_line(l_ab, c, d);
if ( res == SMALLER )
{
return true;
}
else if ( res == EQUAL )
{
return lexicographically_xy_smaller( c, d );
}
else
{
return false;
}
}
private:
mutable bool line_constructed;
mutable Line l_ab;
};
} // namespace internal
} //namespace CGAL
#endif // CGAL_CH_FUNCTION_OBJECTS_2_H
|
