• Login
    View Item 
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 19 (2000)
    • Issue 2
    • View Item
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 19 (2000)
    • Issue 2
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Conflict Neutralization on Binary Space Partitioning

    Thumbnail
    View/Open
    451.pdf (298.2Kb)
    Date
    2000
    Author
    James, A.
    Day, A.M.
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    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'.
    BibTeX
    @article {10.1111:1467-8659.00451,
    journal = {Computer Graphics Forum},
    title = {{Conflict Neutralization on Binary Space Partitioning}},
    author = {James, A. and Day, A.M.},
    year = {2000},
    publisher = {Blackwell Publishers Ltd and the Eurographics Association},
    ISSN = {1467-8659},
    DOI = {10.1111/1467-8659.00451}
    }
    URI
    http://dx.doi.org/10.1111/1467-8659.00451
    Collections
    • Issue 2

    Eurographics Association copyright © 2013 - 2021 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2021 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA