CGAL users discussion list

> Yes, I refer to Nef_nary_union_3. It only stores log(n) of n given
> polyhedra.
> I know that it looks very simple, but there is more to it than you see on
> first sight.

Alright, my apologies! I gave it a better look and there is certainly a
lot of cleverness in there. And it performs much, much better than a naive
accumulation. Although, if I may pick on a point, I can't see that this is
due to any great memory advantage: I can see that there are log(n) Nefs,
but their total size should be proportional to the size of a "naive
accumulation" at the same stage.

On the other hand, I can observe that the geometry of any input Nef
participates in log(n) binary operations, versus O(n) for a naive
accumulation. That seems optimal.

Meanwhile, any word on whether it makes sense to perform nary overlays and
nary marking? Is there a theoretical issue with this?

Regards,
Fred