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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
// Copyright (c) 1998 Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
// and Tel-Aviv University (Israel). 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 Lesser General Public License as
// published by the Free Software Foundation; version 2.1 of the License.
// See the file LICENSE.LGPL distributed with CGAL.
//
// 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/CGAL-3.2-branch/Generator/include/CGAL/Random_convex_set_traits_2.h $
// $Id: Random_convex_set_traits_2.h 28567 2006-02-16 14:30:13Z lsaboret $
//
//
// Author(s) : Michael Hoffmann <hoffmann@inf.ethz.ch>
#if ! (CGAL_RANDOM_CONVEX_SET_TRAITS_2_H)
#define CGAL_RANDOM_CONVEX_SET_TRAITS_2_H 1
#include <CGAL/Point_2.h>
CGAL_BEGIN_NAMESPACE
template < class Kernel >
struct Random_convex_set_traits_2 {
typedef typename Kernel::Point_2 Point_2;
typedef typename Kernel::Direction_2 Direction_2;
typedef typename Kernel::FT FT;
Random_convex_set_traits_2() : _origin( ORIGIN)
{}
const Point_2 &
origin() const
{ return _origin; }
struct Max_coordinate
: public std::unary_function< Point_2, FT >
{
FT
operator()( const Point_2& p) const
{ return max( CGAL_NTS abs( p.x()), CGAL_NTS abs( p.y())); }
};
struct Sum
: public std::binary_function< Point_2, Point_2, Point_2 >
{
Point_2
operator()( const Point_2& p, const Point_2& q) const
{ return p + (q - ORIGIN); }
};
struct Scale
: public std::binary_function< Point_2, FT, Point_2 >
{
Point_2
operator()( const Point_2& p, const FT& k) const
{ return ORIGIN + (p - ORIGIN) * k; }
};
struct Angle_less
: public std::binary_function< Point_2, Point_2, bool >
{
bool
operator()( const Point_2& p, const Point_2& q) const
{
return Direction_2( p - ORIGIN) < Direction_2( q - ORIGIN);
}
};
private:
Point_2 _origin;
};
template <class Kernel>
struct Random_convex_set_traits : public Random_convex_set_traits_2<Kernel>
{};
template < class OutputIterator, class Point_generator >
inline
OutputIterator
random_convex_set_2( int n,
OutputIterator o,
const Point_generator& pg)
{
typedef typename Point_generator::value_type Point_2;
return CGAL_random_convex_set_2(n, o, pg, reinterpret_cast<Point_2*>(0));
}
template < class OutputIterator, class Point_generator, class R >
inline
OutputIterator
CGAL_random_convex_set_2( int n,
OutputIterator o,
const Point_generator& pg,
Point_2< R >*)
{
return random_convex_set_2(
n, o, pg, Random_convex_set_traits_2< R >());
}
CGAL_END_NAMESPACE
#endif // ! (CGAL_RANDOM_CONVEX_SET_TRAITS_2_H)
|
