A comparison of mesh simplification algorithm
A comparison of mesh simplification algorithm
复制标题
DOI：
10.1016/s0097-8493(97)00082-4
复制
发表时间：
1998-01-01
影响因子：
2.5
通讯作者：
Scopigno, R
中科院分区：
文献类型：
--
作者：
Cignoni, P;Montani, C;Scopigno, R
在许多应用中，对精确简化表面网格的需求变得越来越迫切。这种需求不仅是由于渲染速度的原因，也是为了允许在基于网络的应用程序中快速传输3D模型。在过去的几年中，已经提出了许多不同的网格简化方法和算法。我们对这些基本方法进行了综述和描述。此外，还讨论了公共领域现有简化码的经验比较结果。选择了五种实现，以提供广泛的不同拓扑保持方法，在一组样本表面上运行。我们比较了经验计算复杂性和所得输出网格的近似精度。1998爱思唯尔科学有限公司版权所有。
In many applications the need for an accurate simplification of surface meshes is becoming more and more urgent. This need is not only due to rendering speed reasons, but also to allow fast transmission of 3D models in network-based applications. Many different approaches and algorithms for mesh simplification have been proposed in the last few years. We present a survey and a characterization of the fundamental methods. Moreover, the results of an empirical comparison of the simplification codes available in the public domain are discussed. Five implementations, chosen to give a wide spectrum of different topology preserving methods, were run on a set of sample surfaces. We compared empirical computational complexities and the approximation accuracy of the resulting output meshes. (C) 1998 Elsevier Science Ltd. All rights reserved.