Abstract

The paper describes the implementation of an asynchronous view dependent simplification algorithm based on hierarchical vertex clustering. The clustering is performed by using an octree and observing a screenspace error over all tree nodes. The simplification neither requires nor preserves manifold topology and allows drastic simplification of large polygonal models.

KEYWORDS: view dependent simplification, mesh simplification, level of detail, non-manifold, asynchronous, multi-threaded.