E-mail

E-mail a Wiley Online Library Link

Ari Silvennoinen, Hannu Saransaari, Samuli Laine and Jaakko Lehtinen Occluder Simplification Using Planar Sections Computer Graphics Forum 33

Version of Record online: 15 DEC 2013 | DOI: 10.1111/cgf.12271

Thumbnail image of graphical 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.

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field

SEARCH