-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathcellular_automata.h
167 lines (138 loc) · 4.33 KB
/
cellular_automata.h
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
#pragma once
#include <vector>
#include <tuple>
#include <cmath>
#include "internals.h"
#include "geometry/distance.h"
namespace corgi { namespace ca {
/// Moore neighborhood of different dimensions
// using SFINAE to pick dimensionality specialization
template<std::size_t D, typename T = std::enable_if_t<(D==1),int> >
std::vector< corgi::internals::tuple_of<D, T> > moore_neighborhood()
{
std::vector< corgi::internals::tuple_of<D,int> > ret = {
{std::make_tuple(-1), std::make_tuple(+1)}
};
return ret;
}
template<std::size_t D, typename T = std::enable_if_t<(D==2),int> >
std::vector< corgi::internals::tuple_of<2,int> > moore_neighborhood()
{
//std::vector< corgi::internals::tuple_of<2,int> > ret = {
// { std::make_tuple(-1, -1),
// std::make_tuple(-1, 0),
// std::make_tuple(-1, +1),
// std::make_tuple( 0, +1),
// std::make_tuple(+1, +1),
// std::make_tuple( 0, +1),
// std::make_tuple(+1, -1),
// std::make_tuple( 0, -1) }
//};
std::vector< corgi::internals::tuple_of<2,int> > ret;
ret.reserve(8);
for (int jr=-1; jr<=1; jr++) {
for (int ir=-1; ir<=1; ir++) {
if (!( ir == 0 && jr == 0 )) {
ret.emplace_back(ir, jr );
}
}
}
return ret;
}
template<std::size_t D, typename T = std::enable_if_t<(D==3),int> >
std::vector< corgi::internals::tuple_of<3,int> > moore_neighborhood()
{
std::vector< corgi::internals::tuple_of<3,int> > ret;
ret.reserve(26);
for (int kr=-1; kr<=1; kr++) {
for (int jr=-1; jr<=1; jr++) {
for (int ir=-1; ir<=1; ir++) {
if (!( ir == 0 && jr == 0 && kr == 0 )) {
ret.emplace_back(ir, jr, kr );
}
}
}
}
return ret;
}
// Box distances
//--------------------------------------------------
template<std::size_t D, typename T = std::enable_if_t<(D==1),int> >
std::vector< corgi::internals::tuple_of<1,int> > chessboard_neighborhood(int radius)
{
std::vector< corgi::internals::tuple_of<1,int> > ret;
for (int ir=-radius; ir<=radius; ir++) {
if (!( ir == 0 )) {
ret.emplace_back(ir );
}
}
return ret;
}
template<std::size_t D, typename T = std::enable_if_t<(D==2),int> >
std::vector< corgi::internals::tuple_of<2,int> > chessboard_neighborhood(int radius)
{
std::vector< corgi::internals::tuple_of<2,int> > ret;
for (int jr=-radius; jr<=radius; jr++) {
for (int ir=-radius; ir<=radius; ir++) {
if (!( ir == 0 && jr == 0 )) {
ret.emplace_back(ir, jr );
}
}
}
return ret;
}
template<std::size_t D, typename T = std::enable_if_t<(D==3),int> >
std::vector< corgi::internals::tuple_of<3,int> > chessboard_neighborhood(int radius)
{
std::vector< corgi::internals::tuple_of<3,int> > ret;
for (int kr=-radius; kr<=radius; kr++) {
for (int jr=-radius; jr<=radius; jr++) {
for (int ir=-radius; ir<=radius; ir++) {
if (!( ir == 0 && jr == 0 && kr == 0)) {
ret.emplace_back(ir, jr, kr );
}
}
}
}
return ret;
}
// Spherical distances
//--------------------------------------------------
template<std::size_t D, typename T = std::enable_if_t<(D==1),int> >
std::vector< corgi::internals::tuple_of<1,int> > euler_neighborhood(int radius)
{
return chessboard_neighborhood<1>(radius);
}
template<std::size_t D, typename T = std::enable_if_t<(D==2),int> >
std::vector< corgi::internals::tuple_of<2,int> > euler_neighborhood(int radius)
{
std::vector< corgi::internals::tuple_of<2,int> > ret;
for (int jr=-radius; jr<=radius; jr++) {
for (int ir=-radius; ir<=radius; ir++) {
auto rel = std::make_tuple(ir,jr);
if( ::corgi::geom::eulerian_distance<D>(rel) >= (double)radius ) continue;
if (!( ir == 0 && jr == 0 )) {
ret.push_back( rel );
}
}
}
return ret;
}
template<std::size_t D, typename T = std::enable_if_t<(D==3),int> >
std::vector< corgi::internals::tuple_of<3,int> > euler_neighborhood(int radius)
{
std::vector< corgi::internals::tuple_of<3,int> > ret;
for (int kr=-radius; kr<=radius; kr++) {
for (int jr=-radius; jr<=radius; jr++) {
for (int ir=-radius; ir<=radius; ir++) {
auto rel = std::make_tuple(ir,jr,kr);
if( ::corgi::geom::eulerian_distance<D>(rel) >= (double)radius ) continue;
if (!( ir == 0 && jr == 0 && kr == 0)) {
ret.push_back( rel );
}
}
}
}
return ret;
}
} } // ns corgi::ca