Real Z-sorting
08.07.2007 Anton VolkovThe first results with real Z-sorting are received. Geometry comparison of each poly and forming of hierarchy “who behind whom” is applied for this purpose. We have done some optimizations, but it is now clear, that the real sorting is slower than a sorting on averages Z. Other question — on how much?
07.12.2008 в 03:43
great stuff!
what is the mathematical basis of this z-sorting formula?
12.12.2008 в 02:30
George, http://en.wikipedia.org/wiki/Binary_space_partitioning
12.12.2008 в 03:24
This is not a BSP. It is a screen-space sorting system (you can see a boundmap in 4th demo).
This algorithm creates a graph between all conflicted faces. This is not a fast solution, that is why we switched to BSP in 5.0 version.