3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU Lesser General Public License as published by
7 the Free Software Foundation; either version 2.1 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
21 #include "mathconstants.h"
24 #include "../constants.h" // BS, MAP_BLOCKSIZE
25 #include "../noise.h" // PseudoRandom, PcgRandom
29 std::map<u16, std::vector<v3s16> > FacePositionCache::m_cache;
30 // Calculate the borders of a "d-radius" cube
31 std::vector<v3s16> FacePositionCache::getFacePositions(u16 d)
33 if (m_cache.find(d) != m_cache.end())
36 generateFacePosition(d);
41 void FacePositionCache::generateFacePosition(u16 d)
43 m_cache[d] = std::vector<v3s16>();
45 m_cache[d].push_back(v3s16(0,0,0));
50 This is an optimized sequence of coordinates.
52 m_cache[d].push_back(v3s16( 0, 1, 0)); // top
53 m_cache[d].push_back(v3s16( 0, 0, 1)); // back
54 m_cache[d].push_back(v3s16(-1, 0, 0)); // left
55 m_cache[d].push_back(v3s16( 1, 0, 0)); // right
56 m_cache[d].push_back(v3s16( 0, 0,-1)); // front
57 m_cache[d].push_back(v3s16( 0,-1, 0)); // bottom
59 m_cache[d].push_back(v3s16(-1, 0, 1)); // back left
60 m_cache[d].push_back(v3s16( 1, 0, 1)); // back right
61 m_cache[d].push_back(v3s16(-1, 0,-1)); // front left
62 m_cache[d].push_back(v3s16( 1, 0,-1)); // front right
63 m_cache[d].push_back(v3s16(-1,-1, 0)); // bottom left
64 m_cache[d].push_back(v3s16( 1,-1, 0)); // bottom right
65 m_cache[d].push_back(v3s16( 0,-1, 1)); // bottom back
66 m_cache[d].push_back(v3s16( 0,-1,-1)); // bottom front
67 m_cache[d].push_back(v3s16(-1, 1, 0)); // top left
68 m_cache[d].push_back(v3s16( 1, 1, 0)); // top right
69 m_cache[d].push_back(v3s16( 0, 1, 1)); // top back
70 m_cache[d].push_back(v3s16( 0, 1,-1)); // top front
72 m_cache[d].push_back(v3s16(-1, 1, 1)); // top back-left
73 m_cache[d].push_back(v3s16( 1, 1, 1)); // top back-right
74 m_cache[d].push_back(v3s16(-1, 1,-1)); // top front-left
75 m_cache[d].push_back(v3s16( 1, 1,-1)); // top front-right
76 m_cache[d].push_back(v3s16(-1,-1, 1)); // bottom back-left
77 m_cache[d].push_back(v3s16( 1,-1, 1)); // bottom back-right
78 m_cache[d].push_back(v3s16(-1,-1,-1)); // bottom front-left
79 m_cache[d].push_back(v3s16( 1,-1,-1)); // bottom front-right
84 // Take blocks in all sides, starting from y=0 and going +-y
85 for(s16 y=0; y<=d-1; y++) {
86 // Left and right side, including borders
87 for(s16 z=-d; z<=d; z++) {
88 m_cache[d].push_back(v3s16(d,y,z));
89 m_cache[d].push_back(v3s16(-d,y,z));
91 m_cache[d].push_back(v3s16(d,-y,z));
92 m_cache[d].push_back(v3s16(-d,-y,z));
95 // Back and front side, excluding borders
96 for(s16 x=-d+1; x<=d-1; x++) {
97 m_cache[d].push_back(v3s16(x,y,d));
98 m_cache[d].push_back(v3s16(x,y,-d));
100 m_cache[d].push_back(v3s16(x,-y,d));
101 m_cache[d].push_back(v3s16(x,-y,-d));
106 // Take the bottom and top face with borders
107 // -d<x<d, y=+-d, -d<z<d
108 for(s16 x=-d; x<=d; x++)
109 for(s16 z=-d; z<=d; z++) {
110 m_cache[d].push_back(v3s16(x,-d,z));
111 m_cache[d].push_back(v3s16(x,d,z));
123 return g_pcgrand.next();
126 void mysrand(unsigned int seed)
128 g_pcgrand.seed(seed);
131 void myrand_bytes(void *out, size_t len)
133 g_pcgrand.bytes(out, len);
136 int myrand_range(int min, int max)
138 return g_pcgrand.range(min, max);
143 64-bit unaligned version of MurmurHash
145 u64 murmur_hash_64_ua(const void *key, int len, unsigned int seed)
147 const u64 m = 0xc6a4a7935bd1e995ULL;
149 u64 h = seed ^ (len * m);
151 const u64 *data = (const u64 *)key;
152 const u64 *end = data + (len / 8);
154 while (data != end) {
156 memcpy(&k, data, sizeof(u64));
167 const unsigned char *data2 = (const unsigned char *)data;
169 case 7: h ^= (u64)data2[6] << 48;
170 case 6: h ^= (u64)data2[5] << 40;
171 case 5: h ^= (u64)data2[4] << 32;
172 case 4: h ^= (u64)data2[3] << 24;
173 case 3: h ^= (u64)data2[2] << 16;
174 case 2: h ^= (u64)data2[1] << 8;
175 case 1: h ^= (u64)data2[0];
187 blockpos: position of block in block coordinates
188 camera_pos: position of camera in nodes
189 camera_dir: an unit vector pointing to camera direction
192 bool isBlockInSight(v3s16 blockpos_b, v3f camera_pos, v3f camera_dir,
193 f32 camera_fov, f32 range, f32 *distance_ptr)
195 v3s16 blockpos_nodes = blockpos_b * MAP_BLOCKSIZE;
197 // Block center position
199 ((float)blockpos_nodes.X + MAP_BLOCKSIZE/2) * BS,
200 ((float)blockpos_nodes.Y + MAP_BLOCKSIZE/2) * BS,
201 ((float)blockpos_nodes.Z + MAP_BLOCKSIZE/2) * BS
204 // Block position relative to camera
205 v3f blockpos_relative = blockpos - camera_pos;
208 f32 d = blockpos_relative.getLength();
213 // If block is far away, it's not in sight
217 // Maximum radius of a block. The magic number is
218 // sqrt(3.0) / 2.0 in literal form.
219 f32 block_max_radius = 0.866025403784 * MAP_BLOCKSIZE * BS;
221 // If block is (nearly) touching the camera, don't
222 // bother validating further (that is, render it anyway)
223 if(d < block_max_radius)
226 // Adjust camera position, for purposes of computing the angle,
227 // such that a block that has any portion visible with the
228 // current camera position will have the center visible at the
230 f32 adjdist = block_max_radius / cos((M_PI - camera_fov) / 2);
232 // Block position relative to adjusted camera
233 v3f blockpos_adj = blockpos - (camera_pos - camera_dir * adjdist);
235 // Distance in camera direction (+=front, -=back)
236 f32 dforward = blockpos_adj.dotProduct(camera_dir);
238 // Cosine of the angle between the camera direction
239 // and the block direction (camera_dir is an unit vector)
240 f32 cosangle = dforward / blockpos_adj.getLength();
242 // If block is not in the field of view, skip it
243 if(cosangle < cos(camera_fov / 2))