nexoniarz/Fry3DX
Watch
1
0
Fork
You've already forked Fry3DX
 0
mirror of https://github.com/Nexoniarz/Fry3DX.git synced 2026-11-03 04:24:26 +00:00
Code Issues Projects Releases Packages Wiki Activity

Picking and seeing through a tree of boxes per object (made again only when it changes)

Browse source 
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This commit is contained in:
Nexoniarz 2026-10-21 00:24:50 +02:00
commit ecd7c2cfda
5 changed files with 217 additions and 46 deletions
Download patch file Download diff file Expand all files Collapse all files

20
tests/mesh_test.cpp
View file

@ -1,5 +1,6 @@
// The modelling core without a window: shapes are closed and face out, faces with dents
// triangulate right, extrude / inset / merge keep the mesh whole, and files round-trip.
#include "bvh.h"
#include "mesh.h"
#include "image.h"
#include "scene.h"
@ -362,6 +363,25 @@ int main() {
CHECK(combine(a, drill, Combine::Subtract) && checkForPrint(a).closed() && checkForPrint(a).volume < 1.0f && checkForPrint(a).volume > 0.85f,
"a cylinder drilled through a cube: closed, %g m3", checkForPrint(a).volume);
}
// The tree of boxes finds the same nearest hit as trying every triangle (and the same "in the way").
{
Mesh m = makeSphere(32, 16, 1.0f);
const glm::mat4 M = glm::translate(glm::mat4(1), glm::vec3(0.3f, -0.2f, 0.5f)) * glm::rotate(glm::mat4(1), 0.7f, glm::vec3(0, 1, 0));
const TriangleTree tree(m, M);
uint32_t seed = 7;
auto rnd = [&] { return (seed = seed * 1664525u + 1013904223u) / 4294967296.0f * 2 - 1; };
int same = 0, tries = 300;
for (int i = 0; i < tries; ++i) {
const glm::vec3 o(rnd() * 3, rnd() * 3, rnd() * 3 + 3), d = glm::normalize(glm::vec3(rnd(), rnd(), rnd() - 1.5f));
float best = 1e30f;
for (size_t f = 0; f < m.faces.size(); ++f)
for (const auto& t : triangulate(m, int(f)))
if (auto h = rayTriangle(o, d, glm::vec3(M * glm::vec4(m.verts[size_t(t[0])], 1)), glm::vec3(M * glm::vec4(m.verts[size_t(t[1])], 1)), glm::vec3(M * glm::vec4(m.verts[size_t(t[2])], 1)))) best = std::min(best, *h);
const auto h = tree.nearest(o, d);
if ((best > 1e29f && !h) || (h && std::abs(h->t - best) < 1e-4f && tree.blocked(o, d, best + 1e-3f) && !tree.blocked(o, d, best - 1e-3f))) ++same;
}
CHECK(same == tries, "the tree of boxes finds what trying every triangle does (%d of %d)", same, tries);
}
// Shapes drawn and cut in, again and again inside the last cut, on a turned object (the shape
// carried into its own space, as the Draw tool does). This once built its tree forever and
// crashed; and the cutting's rounding left small gaps.