Skip to content
Discussion options

You must be logged in to vote

Hi,
I checked the code with your data and it the code seems correct. Every leaf node has 0 or 1 point inside. However, the parent nodes can have more than 8 points. This just means, that not all of their child nodes are leaf nodes.

In CGAL 5.6, the octree subdivides the cubic bounding box of the input data. Every node has a cubic bounding box. From CGAL 6.0, the octree can subdivide non-cubic spaces and nodes can have non-cubic bounding boxes. As your input data is not a grid with 2^n points evenly spaced along each axis, the leaf nodes are not all at the same depth in the tree.

Replies: 1 comment 1 reply

Comment options

You must be logged in to vote
1 reply
@Monsterever
Comment options

Answer selected by MaelRL
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants