Skip to content

Fast octree count

Jean-Guillaume Piccinali requested to merge fast-count into develop

Created by: sebkelle1

Uses a prefix scan of the previous counts as start guess for the binary search. Reduces formal scaling from NlogN to N.

Merge request reports