RE: [Algorithms] Inscribed Box (was: Re: BSP, PVS, and Detail Obj ects)

[Bruce W. <bwo...@in...>]

BTW, has anyone tried contained point-stamps as occluders?  Seems like
spending less time rasterizing more occluders to an occlusion buffer (or
some such) would be a good thing...

---bruce

-----Original Message-----
From: Pierre Terdiman [mailto:p.t...@wa...]
Sent: Monday, July 02, 2001 2:47 PM
To: gda...@li...
Subject: Re: [Algorithms] Inscribed Box (was: Re: BSP, PVS, and Detail
Objects)


A dumb-and-slow-yet-effective solution is to use a sampling approach.

1) Sample the AABB of the mesh for inside points
2) Grow a contained box starting from each sampled position
3) Keep the biggest...

Slow as hell but takes some lines of code to implement and provides usable
results, good-enough for the PVS problem.

http://www.codercorner.com/InnerBox_Sphere.jpg
http://www.codercorner.com/InnerBox_Pyramid.jpg
http://www.codercorner.com/InnerBox_Bunny.jpg

Note: you can also compute multiple boxes / mesh. It's a good thing to make
them overlap a bit.

HTH....

Pierre Terdiman      *   Home: p.t...@wa...
Coder in the dark    *   Zappy's Lair:  www.codercorner.com


----- Original Message -----
From: Yohanes Yogi Wahyu P. <yo...@ya...>
To: <gda...@li...>
Sent: Monday, July 02, 2001 4:58 AM
Subject: [Algorithms] Inscribed Box (was: Re: BSP, PVS, and Detail Objects)


> ----- Original Message -----
> From: Emmanuel Astier <emm...@wi...>
> Subject: RE: [Algorithms] BSP, PVS, and Detail Objects
>
> > But you can find a 'biggest Inner box'...
>
> Just curious, anyone have a solution for this?
>
>
> Yohanes Yogi Wahyu P.
>
>
> _______________________________________________
> GDAlgorithms-list mailing list
> GDA...@li...
> http://lists.sourceforge.net/lists/listinfo/gdalgorithms-list


_______________________________________________
GDAlgorithms-list mailing list
GDA...@li...
http://lists.sourceforge.net/lists/listinfo/gdalgorithms-list