src/world.cpp

   1 #include "world.hpp"
   2
   3 #include <limits>
   4 #include <glm/gtx/transform.hpp>
   5
   6
   7 namespace blank {
   8
   9 const BlockType BlockType::DEFAULT;
  10 const CuboidShape BlockType::DEFAULT_SHAPE({{ 0, 0, 0 }, { 1, 1, 1 }});
  11
  12 void BlockType::FillVBO(
  13         const glm::vec3 &pos,
  14         std::vector<glm::vec3> &vertices,
  15         std::vector<glm::vec3> &colors,
  16         std::vector<glm::vec3> &normals
  17 ) const {
  18         shape->Vertices(vertices, pos);
  19         colors.insert(colors.end(), shape->VertexCount(), color);
  20         shape->Normals(normals);
  21 }
  22
  23 void BlockType::FillOutlineVBO(
  24         std::vector<glm::vec3> &vertices,
  25         std::vector<glm::vec3> &colors
  26 ) const {
  27         shape->Outline(vertices);
  28         colors.insert(colors.end(), shape->OutlineCount(), outline_color);
  29 }
  30
  31
  32 BlockTypeRegistry::BlockTypeRegistry() {
  33         Add(BlockType::DEFAULT);
  34 }
  35
  36 int BlockTypeRegistry::Add(const BlockType &t) {
  37         int id = types.size();
  38         types.push_back(t);
  39         types.back().id = id;
  40         return id;
  41 }
  42
  43
  44 Chunk::Chunk()
  45 : blocks(Size())
  46 , model()
  47 , transform(1.0f)
  48 , dirty(false) {
  49
  50 }
  51
  52 Chunk::Chunk(Chunk &&other)
  53 : blocks(std::move(other.blocks))
  54 , model(std::move(other.model))
  55 , transform(other.transform)
  56 , dirty(other.dirty) {
  57
  58 }
  59
  60 Chunk &Chunk::operator =(Chunk &&other) {
  61         blocks = std::move(other.blocks);
  62         model = std::move(other.model);
  63         transform = other.transform;
  64         dirty = other.dirty;
  65         return *this;
  66 }
  67
  68
  69 void Chunk::Draw() {
  70         if (dirty) {
  71                 Update();
  72         }
  73         model.Draw();
  74 }
  75
  76
  77 bool Chunk::Intersection(
  78         const Ray &ray,
  79         const glm::mat4 &M,
  80         int *blkid,
  81         float *dist,
  82         glm::vec3 *normal) const {
  83         { // rough check
  84                 const AABB bb{{0, 0, 0}, {Width(), Height(), Depth()}};
  85                 if (!blank::Intersection(ray, bb, M)) {
  86                         return false;
  87                 }
  88         }
  89
  90         if (!blkid && !dist && !normal) {
  91                 return true;
  92         }
  93
  94         // TODO: should be possible to heavily optimize this
  95         int id = 0;
  96         int closest_id = -1;
  97         float closest_dist = std::numeric_limits<float>::infinity();
  98         glm::vec3 closest_normal(0, 1, 0);
  99         for (int z = 0; z < Depth(); ++z) {
 100                 for (int y = 0; y < Height(); ++y) {
 101                         for (int x = 0; x < Width(); ++x, ++id) {
 102                                 if (!blocks[id].type->visible) {
 103                                         continue;
 104                                 }
 105                                 float cur_dist;
 106                                 glm::vec3 cur_norm;
 107                                 if (blocks[id].type->shape->Intersects(ray, glm::translate(M, glm::vec3(x, y, z)), cur_dist, cur_norm)) {
 108                                         if (cur_dist < closest_dist) {
 109                                                 closest_id = id;
 110                                                 closest_dist = cur_dist;
 111                                                 closest_normal = cur_norm;
 112                                         }
 113                                 }
 114                         }
 115                 }
 116         }
 117
 118         if (closest_id < 0) {
 119                 return false;
 120         }
 121
 122         if (blkid) {
 123                 *blkid = closest_id;
 124         }
 125         if (dist) {
 126                 *dist = closest_dist;
 127         }
 128         if (normal) {
 129                 *normal = closest_normal;
 130         }
 131         return true;
 132 }
 133
 134 void Chunk::Position(const glm::vec3 &pos) {
 135         position = pos;
 136         transform = glm::translate(pos * Extent());
 137 }
 138
 139
 140 int Chunk::VertexCount() const {
 141         // TODO: query blocks as soon as type shapes are implemented
 142         int count = 0;
 143         for (const auto &block : blocks) {
 144                 count += block.type->shape->VertexCount();
 145         }
 146         return count;
 147 }
 148
 149 void Chunk::Update() {
 150         model.Clear();
 151         model.Reserve(VertexCount());
 152
 153         for (int i = 0; i < Size(); ++i) {
 154                 if (blocks[i].type->visible) {
 155                         blocks[i].type->FillModel(ToCoords(i), model);
 156                 }
 157         }
 158
 159         model.Invalidate();
 160         dirty = false;
 161 }
 162
 163
 164 World::World()
 165 : blockType()
 166 , blockShape({{ 0.0f, 0.0f, 0.0f }, { 1.0f, 1.0f, 1.0f }})
 167 , slabShape({{ 0.0f, 0.0f, 0.0f }, { 1.0f, 0.5f, 1.0f }})
 168 , chunks() {
 169         blockType.Add(BlockType{ true, { 1.0f, 1.0f, 1.0f }, &blockShape }); // white block
 170         blockType.Add(BlockType{ true, { 1.0f, 1.0f, 1.0f }, &slabShape }); // white slab
 171         blockType.Add(BlockType{ true, { 1.0f, 0.0f, 0.0f }, &blockShape }); // red block
 172         blockType.Add(BlockType{ true, { 1.0f, 0.0f, 0.0f }, &slabShape }); // red slab
 173         blockType.Add(BlockType{ true, { 0.0f, 1.0f, 0.0f }, &blockShape }); // green block
 174         blockType.Add(BlockType{ true, { 0.0f, 1.0f, 0.0f }, &slabShape }); // green slab
 175         blockType.Add(BlockType{ true, { 0.0f, 0.0f, 1.0f }, &blockShape }); // blue block
 176         blockType.Add(BlockType{ true, { 0.0f, 0.0f, 1.0f }, &slabShape }); // blue slab
 177 }
 178
 179
 180 void World::Generate() {
 181         for (int z = -1; z < 2; ++z) {
 182                 for (int y = -1; y < 2; ++y) {
 183                         for (int x = -1; x < 2; ++x) {
 184                                 Generate(glm::vec3(x, y, z));
 185                         }
 186                 }
 187         }
 188 }
 189
 190 Chunk &World::Generate(const glm::vec3 &pos) {
 191         chunks.emplace_back();
 192         Chunk &chunk = chunks.back();
 193         chunk.Position(pos);
 194         for (int i = 1; i < 9; ++i) {
 195                 chunk.BlockAt(i) = Block(blockType[i]);
 196                 chunk.BlockAt(i + 257) = Block(blockType[i]);
 197                 chunk.BlockAt(i + 514) = Block(blockType[i]);
 198         }
 199         if (false) {
 200                 chunk.BlockAt(glm::vec3(0, 0, 0)) = Block(blockType[4]);
 201                 chunk.BlockAt(glm::vec3(0, 0, 1)) = Block(blockType[1]);
 202                 chunk.BlockAt(glm::vec3(1, 0, 0)) = Block(blockType[5]);
 203                 chunk.BlockAt(glm::vec3(1, 0, 1)) = Block(blockType[3]);
 204                 chunk.BlockAt(glm::vec3(2, 0, 0)) = Block(blockType[4]);
 205                 chunk.BlockAt(glm::vec3(2, 0, 1)) = Block(blockType[1]);
 206                 chunk.BlockAt(glm::vec3(3, 0, 0)) = Block(blockType[2]);
 207                 chunk.BlockAt(glm::vec3(3, 0, 1)) = Block(blockType[5]);
 208                 chunk.BlockAt(glm::vec3(2, 0, 2)) = Block(blockType[4]);
 209                 chunk.BlockAt(glm::vec3(2, 0, 3)) = Block(blockType[1]);
 210                 chunk.BlockAt(glm::vec3(3, 0, 2)) = Block(blockType[2]);
 211                 chunk.BlockAt(glm::vec3(3, 0, 3)) = Block(blockType[5]);
 212                 chunk.BlockAt(glm::vec3(1, 1, 0)) = Block(blockType[5]);
 213                 chunk.BlockAt(glm::vec3(1, 1, 1)) = Block(blockType[4]);
 214                 chunk.BlockAt(glm::vec3(2, 1, 1)) = Block(blockType[3]);
 215                 chunk.BlockAt(glm::vec3(2, 2, 1)) = Block(blockType[2]);
 216         }
 217         chunk.Invalidate();
 218         return chunk;
 219 }
 220
 221 bool World::Intersection(
 222                 const Ray &ray,
 223                 const glm::mat4 &M,
 224                 Chunk **chunk,
 225                 int *blkid,
 226                 float *dist,
 227                 glm::vec3 *normal) {
 228         Chunk *closest_chunk = nullptr;
 229         int closest_blkid = -1;
 230         float closest_dist = std::numeric_limits<float>::infinity();
 231         glm::vec3 closest_normal;
 232
 233         for (Chunk &cur_chunk : chunks) {
 234                 int cur_blkid;
 235                 float cur_dist;
 236                 glm::vec3 cur_normal;
 237                 if (cur_chunk.Intersection(ray, M * cur_chunk.Transform(), &cur_blkid, &cur_dist, &cur_normal)) {
 238                         if (cur_dist < closest_dist) {
 239                                 closest_chunk = &cur_chunk;
 240                                 closest_blkid = cur_blkid;
 241                                 closest_dist = cur_dist;
 242                                 closest_normal = cur_normal;
 243                         }
 244                 }
 245         }
 246
 247         if (chunk) {
 248                 *chunk = closest_chunk;
 249         }
 250         if (blkid) {
 251                 *blkid = closest_blkid;
 252         }
 253         if (dist) {
 254                 *dist = closest_dist;
 255         }
 256         if (normal) {
 257                 *normal = closest_normal;
 258         }
 259         return closest_chunk;
 260 }
 261
 262
 263 Chunk &World::Next(const Chunk &to, const glm::vec3 &dir) {
 264         const glm::vec3 tgt_pos = to.Position() + dir;
 265         for (Chunk &chunk : chunks) {
 266                 if (chunk.Position() == tgt_pos) {
 267                         return chunk;
 268                 }
 269         }
 270         return Generate(tgt_pos);
 271 }
 272
 273 }