Re: ComputeSphereVisibility: a patch

2008-11-17 Thread Henri Verbeet
2008/11/17 paulo lesgaz [EMAIL PROTECTED]: The problem is that the test takes the value 0x3f once (if the test is correct), and that my function can not never obtain such a value. Looks like you need to set one of the D3DVIS_INSIDE_FRUSTUM/D3DVIS_INTERSECT_FRUSTUM/D3DVIS_OUTSIDE_FRUSTUM flags,

Re: ComputeSphereVisibility: a patch

2008-11-16 Thread Henri Verbeet
2008/11/15 Frank Richter [EMAIL PROTECTED]: On 14.11.2008 20:27, paulo lesgaz wrote: Hi, here is a patch for a first try to implement ComputeSphereVisibility. Any feedback is welcome. I think you can simplify the sphere-plane intersection. Just compute the signed distance D of the sphere

Re: ComputeSphereVisibility: a patch

2008-11-16 Thread paulo lesgaz
Hi, here is a new patch for ComputeSphereVisibility implementing Henri and Franck's idea. The problem is that the test takes the value 0x3f onceĀ  (if the test is correct), and that my function can not never obtain such a value. Any idea to fix this problem. Here is the only one link talking

Re: ComputeSphereVisibility: a patch

2008-11-15 Thread Frank Richter
On 14.11.2008 20:27, paulo lesgaz wrote: Hi, here is a patch for a first try to implement ComputeSphereVisibility. Any feedback is welcome. I think you can simplify the sphere-plane intersection. Just compute the signed distance D of the sphere center from the plane. If D r, the sphere is

ComputeSphereVisibility: a patch

2008-11-14 Thread paulo lesgaz
Hi, here is a patch for a first try to implement ComputeSphereVisibility. Any feedback is welcome. David 0001-ComputeSphereVisibility.patch Description: Binary data