Volume xx,(200y), Number z pp. 000–000 Conflict Neutralization on Binary Space Partitionin.pdf

Volume xx, (200y), Number z pp. 000–000 Conflict Neutralization on Binary Space Partitioning A. James and A.M. Day School of Information Systems, University of East Anglia, University Plain, Norwich, Norfolk, NR4 7TJ. England. aj@sys.uea.ac.uk, amd@sys.uea.ac.uk Abstract The Binary Space Partitioning (BSP) tree achieves fast hidden surface removal for most practical applications where an observer can move through a scene of static objects. However, the BSP algorithm generally increases the number of polygons in a scene due to its splitting stage resulting in a detrimental effect on the priority ordering and more significantly, the display calculations (shading, lighting, shadows, etc.) of the rendering pipeline. We present the Conflict Neutralization algorithm which attempts to reduce the number of splits more effectively than existing techniques whilst maintaining the ‘standard’ model of a BSP tree. Our idea is similar to Conflict Minimization proposed by Fuchs; the significant difference is that our algorithm recognizes that a polygon suit- able for selection in the Minimization criterion may subsequently stop the remainder of polygons achieving some reductions in cuts—with Conflict Neutralization, such a polygon is demoted. We compare the results of Conflict Neutralization against Conflict Minimization, the Least-crossed with Most- crossed tie-breaking criterion and our own, enhanced implementation of Conflict Minimization. We show how these techniques fall into different ‘depths of analysis’. Keywords: Binary Space Partitioning, Conflict Mini- and in Section 5 we show how Conflict Minimization can be mization