embededvc的专栏

Painters algorithm BSP trees, however, solve both these problems by splitting up objects and ordering them so that the painters algorithm will draw them correctly without need of a Z-buffer and

An octree is a tree data structure in which each internal node has up to eight children. Octrees are most often used to partition a three dimensional space by recursively subdividing it into eight oct

 http://local.wasp.uwa.edu.au/~pbourke/projection/frustum/In order to determine whether part of a primitive is inside the frustum it is necessary to check that every vertex in the primitive is outsi

 http://www.lighthouse3d.com/opengl/picking/

 http://www.lighthouse3d.com/opengl/glsl/index.php?pipeline

 http://www.lighthouse3d.com/opengl/ledshader/

 http://www-csl.csres.utexas.edu/users/billmark/teach/CS395Ta-03-fall/

 http://www.geocities.com/siliconvalley/2151/bsp.html