An efficient local clustering approach for simplification of 3D point-based computer graphics models

摘要

Given a point-based 3D computer graphics model which is defined by a point set P (P = {p{sub}i ∈ R{sup}3}) and a desired reduced number of output samples N{sub}s, the simplification approach finds a point set P{sub}s which (i) satisfies |P{sub}s| = N{sub}s (|P{sub}s| is the cardinality of P{sub}s) and (ii) minimizes the difference of the corresponding surface S{sub}s (defined by P{sub}s) and the original surface S (defined by P). Although a number of previous approaches have been proposed for simplification, most of them (i) do not focus on point-based 3D models, (ii) do not consider efficiency, quality and generality together. In this paper, we introduce an adaptive simplification method (ASM) which is an efficient technique for simplifying point-based complex 3D model. ASM achieves low running time by clustering the points locally based on the preservation of geometric characteristics. Finally, we analyze the performance of ASM and show that it outperforms most of the current state-of-the-art methods in terms of efficiency, quality and generality.