RE : Re: shockwave 3d and bsp trees

Lucas Meijer>

thank you very much for you technique i could call
"hand-made-visible list".



i compared it with a recursion in a bsp tree of convex
sectors

in reality it's not easier: instead of spending time to cut
your map with bsp rules, you spend time to write visible
lists... more, a bsp tree is very easy to travel, a
non-logic sector space is a bit more complex.

But,

But it's infinitely more powerful. map cut is free and not
constrained by bsp rules.
Hidden sector removal is faster (you don't have to travel in
a tree), more precise (portal based occlusion detection is
approximative), and it allows you to alternate indoor and
outdoors in a same map.



so, i send a thousand of thanks to you 

 		
---------------------------------
 Découvrez une nouvelle façon d'obtenir des réponses à
toutes vos questions ! Profitez des connaissances, des
opinions et des expériences des internautes sur Yahoo!
Questions/Réponses.
_______________________________________________
dirGames-L mailing list  -  dirGames-Lnuttybar.drama.uga.edu
http://nuttybar.drama.uga.edu/mailman/listinfo/dirgames
-l