Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement binary tree for pavings #3

Open
dpsanders opened this issue Jun 4, 2016 · 4 comments
Open

Implement binary tree for pavings #3

dpsanders opened this issue Jun 4, 2016 · 4 comments

Comments

@dpsanders
Copy link
Member

No description provided.

@dpsanders
Copy link
Member Author

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
Copy link

c42f commented Jun 25, 2016

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
Copy link
Member Author

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

@dpsanders
Copy link
Member Author

In progress in the paving_as_tree branch.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@dpsanders @c42f