[Algorithms] Area of convex shape inside of a BSP tree

[Juan L. <re...@gm...>]

Hi! Here's another question about an algorithm i've been wondering
since a few days, to implement an idea i had about interior
rendering..

Basically, take a BSP tree of a closed, concave shape that encloses an
area, and also a convex object (that provides a support function), how
could the area of the convex object that is inside the concave object
represented by a BSP tree be calculated?
Finding if they intersect is easy, but it seems to me that calculating
how much of the convex object is inside the BSP tree area is not so
simple.. but maybe i'm missing something?
Also maybe there is another structure that best fits this problem than
a BSP tree?

Cheers

Juan Linietsky