search

JuliaIntervals / IntervalConstraintProgramming.jl

Calculate rigorously the feasible region for a set of real-valued inequalities with Julia
Other
63 stars 16 forks source link

Implement binary tree for pavings #3

Open dpsanders opened 8 years ago

dpsanders commented 8 years ago

https://en.wikipedia.org/wiki/K-d_tree

Ray tracing uses this and has a way to find the neighbouring box. (Thanks to @c42f)

c42f commented 8 years ago

Yes, to me it looks like you're implicitly creating a kdtree during your splitting process. Whether that's actually useful is something I don't know - ray tracing traversal is a somewhat different use case :-)

dpsanders commented 7 years ago

The splitting process actually creates a binary tree, since each interval is bisected only once (currently the side of maximum length is split).

dpsanders commented 7 years ago

In progress in the paving_as_tree branch.