Picking points from the solid geometry in OCC is far slower than a tree implementation. Look at doing this with CGAL instead using a tree of axis-aligned bounding boxes and randomly sampled points. The complexity should drop from N_points*M_faces to log(N_boxes).
Picking points from the solid geometry in OCC is far slower than a tree implementation. Look at doing this with CGAL instead using a tree of axis-aligned bounding boxes and randomly sampled points. The complexity should drop from N_points*M_faces to log(N_boxes).