X-Git-Url: http://git.localhorst.tv/?a=blobdiff_plain;f=src%2Fworld%2Fworld.cpp;h=0daadfc430afe9e56e6be35a2aba9876d4dcd03d;hb=ab0ba4313c473378b4516e3702d524dc1d1fc5d4;hp=bf68a9eca412f295c977e486c465e0794025366a;hpb=f071bb512a09cece895e65ca48eba2a7155d6593;p=blank.git

diff --git a/src/world/world.cpp b/src/world/world.cpp
index bf68a9e..0daadfc 100644
--- a/src/world/world.cpp
+++ b/src/world/world.cpp
@@ -133,7 +133,9 @@ glm::mat4 Entity::ViewTransform(const glm::ivec3 &reference) const noexcept {
 
 Ray Entity::Aim(const ExactLocation::Coarse &chunk_offset) const noexcept {
 	glm::mat4 transform = ViewTransform(chunk_offset);
-	return Ray{ glm::vec3(transform[3]), -glm::vec3(transform[2]) };
+	Ray ray{ glm::vec3(transform[3]), -glm::vec3(transform[2]) };
+	ray.Update();
+	return ray;
 }
 
 void Entity::Update(World &world, float dt) {
@@ -789,8 +791,11 @@ bool World::Intersection(
 
 	candidates.clear();
 
-	// TODO: convert to coords based iteration and trim based
-	//       on ray direction
+	// TODO: change this so the test starts at the chunk of the ray's
+	//       origin and "walks" forward until it hits (actually casting
+	//       the ray, so to say). if this performs well (at least, better
+	//       than now), this could also qualify for the chunk test itself
+	//       see Bresenham's line algo or something similar
 	for (Chunk *cur_chunk : *index) {
 		float cur_dist;
 		if (cur_chunk && cur_chunk->Intersection(ray, reference, cur_dist)) {