After the kd-tree search is done, I’ve added an overlap-check which leaves only triangles with a bounding box intersecting the cutter’s bounding box for the drop-cutter algorithm. It’s seems like a band-aid kind of hack to get it working, I think if the tree-search would be bug free the overlap check would not be needed… [...]

When vimeo has had time to process the video, this will show a visualization of the kd-tree search: http://vimeo.com/10241672 the code is probably still a bit buggy…

I’ve continued to translate into C++ the old cam-experiments I wrote in C#. The kd-tree search for which triangles lie under the cutter seems to work, and the best way to visualize what is going on is through a video. Trying Vimeo for a change, to see if it’s any better than youtube for these [...]

First test with drop-cutter aided by the kd-tree. The output toolpath looks very much like the one without kd-tree, which is good. Less great is that I expected a speed-up of the algorithm – but in fact when I use kd-tree the program slows down! Something to investigate over the next few days.

Drop-cutter requires a fast way of searching for triangles under the tool. A kd-tree (4-dimensional in this case) is suggested by Yau et al. I’ve tried to implement one here (look in trunk/Project2). Just ran some timing tests using Stopwatch() on it, and indeed the build_kdtree() function which takes a pile of triangles as input [...]