Occluder Simplification Using Planar Sections

Ari Silvennoinen, Hannu Saransaari, Samuli Laine, Jaakko Lehtinen

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 ...