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

    Occluder Simplification Using Planar Sections

    Thumbnail
    View/Open
    v33i1pp235-245.pdf (5.085Mb)
    Date
    2014
    Author
    Silvennoinen, Ari
    Saransaari, Hannu
    Laine, Samuli
    Lehtinen, Jaakko
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    We present a method for extreme occluder simplification. We take a triangle soup as input, and produce a small set of polygons with closely matching occlusion properties. In contrast to methods that optimize the original geometry, our algorithm has very few requirements for the input— specifically, the input does not need to be a watertight, two‐manifold mesh. This robustness is achieved by working on a well‐behaved, discretized representation of the input instead of the original, potentially badly structured geometry. We first formulate the algorithm for individual occluders, and further introduce a hierarchy for handling large, complex scenes.We present a method for extreme occluder simplification. We take a triangle soup as input, and produce a small set of polygons with closely matching occlusion properties. In contrast to methods that optimize the original geometry, our algorithm has very few requirements for the input— specifically, the input does not need to be a watertight, two‐manifold mesh. This robustness is achieved by working on a well‐behaved, discretized representation of the input instead of the original, potentially badly structured geometry. We first formulate the algorithm for individual occluders, and further introduce a hierarchy for handling large, complex scenes.
    BibTeX
    @article {10.1111:cgf.12271,
    journal = {Computer Graphics Forum},
    title = {{Occluder Simplification Using Planar Sections}},
    author = {Silvennoinen, Ari and Saransaari, Hannu and Laine, Samuli and Lehtinen, Jaakko},
    year = {2014},
    publisher = {The Eurographics Association and John Wiley and Sons Ltd.},
    ISSN = {1467-8659},
    DOI = {10.1111/cgf.12271}
    }
    URI
    http://dx.doi.org/10.1111/cgf.12271
    Collections
    • 33-Issue 1

    Eurographics Association copyright © 2013 - 2023 
    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

    Statistics

    View Usage Statistics

    BibTeX | TOC

    Create BibTeX Create Table of Contents

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