Occluder Simplification Using Planar Sections
No Thumbnail Available
Date
2014
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and John Wiley and Sons Ltd.
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.
Description
@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}
}