基于细节的自适应网格简化高山.pdfVIP

15 9 Vol.15, No.9 2003 9 JOURNAL OF COMPUTER-AIDED DESIGN COMPUTER GRAPHICS Sep., 2003 　 1) 1) 2) 高　山 　卢汉清 　周万宁 1)(　　1000 0) 2 )(　　100036) 　, . , , . , , ., . 　;;; 　TP391 Detail-Preserving Adaptive Mesh Simplification 1) 1) 2) Gao Shan 　Lu Hanqing 　Zhou Wanning 1)(National Laboratory of Pattern Recognition, Institute of A utomation, Chinese Academy of S ciences, Beij ing 　1000 0) 2 )(Institute of Automation, Navy Demonstration Center, Beij ing 　100036) Abstract 　　From the point of view of keeping geometric details, we present an adaptive simplification method for triangular mesh.We first compute the distance between a vertex and its neighbor, then delete the neighbor w ithin the local simplifying scale and triangulate the hole caused by deletion.Here, the local simplifying scale is the ratio of the local feature size(LFS )to a given global precision control parameter.Amenta N.and Bern M.pointed out that the smaller LFS is, the more details appear on the area w here the vertex is located.Therefore, the local simplification scale is inversely proportional to the global precision control parameter;and it also automatically adjusts according to the surface of model with a given global precision control parameter.The results show that this method can not only reduce the amount of data effectively but also preserve the vision characters very w ell. Key words　mesh simplification;detail;vertex decimation;adaptive ., 1 　　　 ., . , ,、 ,(), ,. , .(LOD) , ,