An efficient nonuniform simplification algorithm was proposed.At first, the minimum cube box of the data sets was gained, and it was divided into eight cubes with employment of octree.

• 摘要提出了一种高效的非均匀简化方法：先求出数据集的最小立方体包围盒，应用八叉树原理将其分割成八个小立方体；