说明: When the original design of the algorithm for Binary Space Partitioning (BSP)-trees was formulated the idea was to use it to sort the polygons in the world. The reason for this was there did not exist hardware accelerated Zbuffers, and software Z-bu <lfy828> 上传 | 大小:771kb