Can anyone recommend any good tutorial on BSP(PVS)? PLEASEEE…
BSPs (based on nodes or on leaves), Portals and so on, are preprocessed space partitioning algorithm.
“BSP” aims at building a binary tree by subdivising the space by planes liying on polygons. So, you can easily get polygons sorted (thus, no problem of transparent polygon) with specific graph traversal. But the performance strictly depends on the database complexity.
“Portal” divides the space in rooms and portals (used for indoor databases like quake…), so there will have no overdraw (only visible rooms will be rendered) .
Here you can found some links: http://reality.sgi.com/bspfaq/index.shtml http://www.exaflop.org/site/frames.cgi?HREF=http://www.exaflop.org/docs/naifgfx/naifbsp.html http://www.cs.virginia.edu/~luebke/publications/portals.html http://www.rz.tu-ilmenau.de/~juhu/Papers/IWK/node26.html http://www.flipcode.com/harmless/issue02.htm http://crystal.linuxgames.com/docs/portal.html http://graphics.lcs.mit.edu/~seth/ http://www.cise.ufl.edu/~areddish/cap6836/ http://www.geocities.com/SiliconValley/Park/9784/tut.html#culling http://www.geocities.com/SiliconValley/Lakes/6588/BSPpaper.html http://www.netmagic.net/~achalfin/Graphics/portal.htm http://members.home.com/droyer/tutorials/Engine05.html
If you want more links, write to me 
Or make a search using the “BSP” word and you will get a lot of links !
Thanks Sancho, you helped me much, but I have one more question: Ive heared that its easy to do collision detection when using BSP. Is it realy so?
P.S. Thanks one more time.