## RE: [Algorithms] Frustum-frustum check

 RE: [Algorithms] Frustum-frustum check From: Jon Watte - 2002-12-30 18:59:51 ```Seems like separating axes (or planes) would be a good choice here. Cheers, / h+ > -----Original Message----- > From: gdalgorithms-list-admin@... > [mailto:gdalgorithms-list-admin@...]On Behalf Of Joris > Mans > Sent: Monday, December 30, 2002 4:00 AM > To: gdAlgorithms-list@... > Subject: [Algorithms] Frustum-frustum check > > > Hi > > Does anyone know how to quickly calculate if 2 view-frustums intersect? > > Thanks > > Joris > > > > ------------------------------------------------------- > This sf.net email is sponsored by:ThinkGeek > Welcome to geek heaven. > http://thinkgeek.com/sf > _______________________________________________ > GDAlgorithms-list mailing list > GDAlgorithms-list@... > https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list > Archives: > http://sourceforge.net/mailarchive/forum.php?forum_id=6188 > ```

 [Algorithms] Frustum-frustum check From: Joris Mans - 2002-12-30 11:59:59 ```Hi Does anyone know how to quickly calculate if 2 view-frustums intersect? Thanks Joris ```
 Re: [Algorithms] Frustum-frustum check From: Pierre Terdiman - 2002-12-30 12:25:20 ```> Does anyone know how to quickly calculate if 2 view-frustums intersect? If your frustum is handled as a convex polytope, the standard generic solutions apply : - GJK - Separating plane algorithm Else a dedicated function, maybe based on the separating-axis theorem, is probably a bit faster. P. ```
 RE: [Algorithms] Frustum-frustum check From: Jon Watte - 2002-12-30 18:59:51 ```Seems like separating axes (or planes) would be a good choice here. Cheers, / h+ > -----Original Message----- > From: gdalgorithms-list-admin@... > [mailto:gdalgorithms-list-admin@...]On Behalf Of Joris > Mans > Sent: Monday, December 30, 2002 4:00 AM > To: gdAlgorithms-list@... > Subject: [Algorithms] Frustum-frustum check > > > Hi > > Does anyone know how to quickly calculate if 2 view-frustums intersect? > > Thanks > > Joris > > > > ------------------------------------------------------- > This sf.net email is sponsored by:ThinkGeek > Welcome to geek heaven. > http://thinkgeek.com/sf > _______________________________________________ > GDAlgorithms-list mailing list > GDAlgorithms-list@... > https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list > Archives: > http://sourceforge.net/mailarchive/forum.php?forum_id=6188 > ```
 [Algorithms] HDR From: Pierre Terdiman - 2003-01-04 01:51:02 ```I just found this and I have to share it..... http://www.daionet.gr.jp/~masa/archives/Test/HDR/mshdribl.zip For a quick overview : - Run the app - Press M to go to next material Yet Another Reason Why Japanese Coders Just Rule :) Cheers, Pierre ```
 Re: [Algorithms] HDR From: Ray - 2003-01-04 04:37:59 ```Wow, that's pretty cool! I wonder how he did that in dx8. - Ray Pierre Terdiman wrote: > I just found this and I have to share it..... > http://www.daionet.gr.jp/~masa/archives/Test/HDR/mshdribl.zip > > For a quick overview : > - Run the app > - Press M to go to next material > > Yet Another Reason Why Japanese Coders Just Rule :) > > Cheers, > Pierre ```