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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
|
// Copyright (c) 2011 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1.1/Spatial_sorting/include/CGAL/Hilbert_sort_middle_2.h $
// $Id: include/CGAL/Hilbert_sort_middle_2.h 08b27d3db14 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
// Author(s) : Olivier Devillers
#ifndef CGAL_HILBERT_SORT_MIDDLE_2_H
#define CGAL_HILBERT_SORT_MIDDLE_2_H
#include <CGAL/config.h>
#include <functional>
#include <cstddef>
#include <CGAL/Hilbert_sort_middle_base.h>
#include <CGAL/number_utils.h>
namespace CGAL {
namespace internal {
template <class K, int x, bool up> struct Fixed_hilbert_cmp_2;
template <class K, int x>
struct Fixed_hilbert_cmp_2<K,x,true>
: public CGAL::cpp98::binary_function<typename K::Point_2,
typename K::Point_2, bool>
{
typedef typename K::Point_2 Point;
K k;
double value;
Fixed_hilbert_cmp_2 (double v, const K &_k) : k(_k),value(v) {}
bool operator() (const Point &p) const
{
return ! Fixed_hilbert_cmp_2<K,x,false> (value, k) (p);
}
};
template <class K>
struct Fixed_hilbert_cmp_2<K,0,false>
: public CGAL::cpp98::binary_function<typename K::Point_2,
typename K::Point_2, bool>
{
typedef typename K::Point_2 Point;
K k;
double value;
Fixed_hilbert_cmp_2 (double v, const K &_k) : k(_k),value(v) {}
bool operator() (const Point &p) const
{
return to_double(k.compute_x_2_object()(p)) < value;
}
};
template <class K>
struct Fixed_hilbert_cmp_2<K,1,false>
: public CGAL::cpp98::binary_function<typename K::Point_2,
typename K::Point_2, bool>
{
typedef typename K::Point_2 Point;
K k;
double value;
Fixed_hilbert_cmp_2 (double v, const K &_k) : k(_k),value(v) {}
bool operator() (const Point &p) const
{
return to_double(k.compute_y_2_object()(p)) < value;
}
};
} // namespace internal
template <class K>
class Hilbert_sort_middle_2
{
public:
typedef K Kernel;
typedef typename Kernel::Point_2 Point;
private:
Kernel _k;
std::ptrdiff_t _limit;
template <int x, bool up>
struct Cmp
: public internal::Fixed_hilbert_cmp_2<Kernel,x,up>
{
Cmp (double v, const Kernel &k) : internal::Fixed_hilbert_cmp_2<Kernel,x,up> (v, k) {}
};
public:
Hilbert_sort_middle_2 (const Kernel &k, std::ptrdiff_t limit = 1)
: _k(k), _limit (limit)
{}
template <int x, bool upx, bool upy, class RandomAccessIterator>
void sort (RandomAccessIterator begin, RandomAccessIterator end,
double xmin, double ymin, double xmax, double ymax) const
{
const int y = (x + 1) % 2;
if (end - begin <= _limit) return;
double xmed= (xmin+xmax)/2;
double ymed= (ymin+ymax)/2;
RandomAccessIterator m0 = begin, m4 = end;
RandomAccessIterator m2 = internal::fixed_hilbert_split (m0, m4, Cmp< x, upx> (xmed,_k));
RandomAccessIterator m1 = internal::fixed_hilbert_split (m0, m2, Cmp< y, upy> (ymed,_k));
RandomAccessIterator m3 = internal::fixed_hilbert_split (m2, m4, Cmp< y, !upy> (ymed,_k));
if (m1!=m4)
sort<y, upy, upx> (m0, m1, ymin, xmin, ymed, xmed);
if (m1!=m0 || m2!=m4)
sort<x, upx, upy> (m1, m2, xmin, ymed, xmed, ymax);
if (m2!=m0 || m3!=m4)
sort<x, upx, upy> (m2, m3, xmed, ymed, xmax, ymax);
if (m3!=m0)
sort<y,!upy,!upx> (m3, m4, ymed, xmax, ymin, xmed);
}
template <class RandomAccessIterator>
void operator() (RandomAccessIterator begin, RandomAccessIterator end) const
{
//Bbox_2 box=bbox_2(begin, end); BUG: WE NEED TO FIX THIS
double xmin=to_double(_k.compute_x_2_object()(*begin)),
ymin=to_double(_k.compute_y_2_object()(*begin)),
xmax=xmin,
ymax=ymin;
for(RandomAccessIterator it=begin+1; it<end; ++it){
if ( to_double(_k.compute_x_2_object()(*it)) < xmin)
xmin = to_double(_k.compute_x_2_object()(*it));
if ( to_double(_k.compute_y_2_object()(*it)) < ymin)
ymin = to_double(_k.compute_y_2_object()(*it));
if ( to_double(_k.compute_x_2_object()(*it)) > xmax)
xmax = to_double(_k.compute_x_2_object()(*it));
if ( to_double(_k.compute_y_2_object()(*it)) > ymax)
ymax = to_double(_k.compute_y_2_object()(*it));
}
sort <0, false, false> (begin, end, xmin, ymin, xmax, ymax);
}
};
} // namespace CGAL
#endif//CGAL_HILBERT_SORT_MIDDLE_2_H
|
