Occluder Simplification Using Planar Sections
Article first published online: 15 DEC 2013
© 2013 The Authors Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd.
Computer Graphics Forum
Volume 33, Issue 1, pages 235–245, February 2014
How to Cite
Silvennoinen, A., Saransaari, H., Laine, S. and Lehtinen, J. (2014), Occluder Simplification Using Planar Sections. Computer Graphics Forum, 33: 235–245. doi: 10.1111/cgf.12271
- Issue published online: 24 FEB 2014
- Article first published online: 15 DEC 2013
- geometry simplification;
- I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling—Curve;
- object representations
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.