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.

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

Code to find bounding boxes is very slow #395

Open
lukehutch opened this issue Jan 17, 2020 · 0 comments
Open

Code to find bounding boxes is very slow #395

lukehutch opened this issue Jan 17, 2020 · 0 comments

Comments

@lukehutch
Copy link

While running build_octree, during the initial Determining bounding box stage I get a processing speed on a fast laptop CPU and SSD of 75,083.64/s, which for a .ply file consisting of 19.1B points, takes 7 hours to process. This is not even remotely saturating the SSD's IO bus or the CPU's processing capabilities, so something is very inefficient in the bounding box calculation code.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant