[Algorithms] octree and HSR

[Jaakko W. <za...@bo...>]

Hi everyone!

I have these few questions about octrees and hiddens surface removal.

First the simple questions:
1. How can I check if line intersects a cube?
2. How can I check if triangle and cube intersect?
3. How do I compute the view frustrum? (I think I need those eight   points)
4. How can I check if the view frustrum and a cube intersect? (or if the cube is inside the view frustrum)

And then these hard ones:

1. Is it possible to know if one of nodes (or cubes) of the octree
is possible to see from certain point? for example if it was behind a wall.

2. Can I use trianlge strips with octrees? If a strip goes through several nodes and for example only one node is visible should I clip the strip?

I would also be interested of good sites.. Don't tell me about those great books like Graphics Gems you have cause I can only read them in my dreams! =)

--Jaakko W--    
         




---JAAKKO--- 
Get your Free E-mail at http://bosti.zzn.com
___________________________________________________________________
Hae oma Web-perusteinen sähköposti palvelusi http://www.zzn.com:sta