Le_Forgeron <jgr### [at] freefr> wrote:
> the question, if I got it right, was: assume a set of objects that might
> intersect (by pair, not with every other...), can we display not the
> objects but only their overlapping volumes, even the ones which are only
> from two objects of the set.
>
> the range <2,-1> is the specification for the answer: keep all
> intersection points that are inside 2 or more objects.
> ( -1 is a way to specify all objects, without having to counting them).
>
> (<1,-1> is a classical union, but union would then be faster)

Thanks, this is exactly what I asked for, only better phrased...
Sadly, I have no idea how to apply a patch, so I can't test it.

some code (c++) that fails to do so. I'm better off looking into povray's
source..

Post a reply to this message