Conflict neutralization on binary space partitioning

James, A. and Day, A. M. (2000) Conflict neutralization on binary space partitioning. Computer Graphics Forum, 19 (2). pp. 153-163. ISSN 0167-7055

Full text not available from this repository. (Request a copy)

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 suitable 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’.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Computer Graphics (former - to 2018) Faculty of Science > Research Groups > Interactive Graphics and Audio
Depositing User:	Vishal Gautam
Date Deposited:	28 Feb 2011 10:42
Last Modified:	24 Sep 2024 10:27
URI:	https://ueaeprints.uea.ac.uk/id/eprint/21708
DOI:	10.1111/1467-8659.00451

Actions (login required)

View Item