Re: [Algorithms] Computing brush center from plane equs

[<Lt...@t-...>]

> You can get a point in the interior of the intersection volume by 
> alternating
> projection. That is, start with an arbitrary point. Loop over all 
> halfspaces
> in whichever order, projecting the point onto the hyperplane of the 
> halfspace
> if it lies outside the halfspace. Repeat projection until the point lies
> inside all halfspaces.

It seems to me like the outcome of thise technique is chaotic (at least 
when I tried it
with pen and paper )  Did you test it yet?

-marius