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
|
/*
* Copyright 2008-2009 NVIDIA Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*! \file hilbert_curve.h
* \brief Cluster points using a Hilbert space filling curve
*/
#pragma once
#include <cusp/detail/config.h>
namespace cusp
{
namespace graph
{
/*! \addtogroup algorithms Algorithms
* \ingroup algorithms
* \{
*/
/*! \p hilbert_curve : Uses a Hilbert space filling curve to partition
* a set of points in 2 or 3 dimensional space.
*
*
* \param Set of points in 2 or 3-D space
* \param number of partitions to construct
* \param partition assigned to each point
*
* \tparam Array coord
* \tparam size_t num_parts
* \tparam Array parts
*
* \see http://en.wikipedia.org/wiki/Hilbert_curve
*/
template <class Array2d, class Array1d>
void hilbert_curve(const Array2d& coord, const size_t num_parts, Array1d& parts);
/*! \}
*/
} // end namespace graph
} // end namespace cusp
#include <cusp/graph/detail/hilbert_curve.inl>
|
