%0 Journal Article
%T A NEW MESH SIMPLIFICATION ALGORITHM BASED ON VERTEX CLUSTERING<br>一种新的基于顶点聚类的网格简化算法
%A ZHOU Kun
%A PAN Zhigeng
%A SHI Jiaoying
%A <br>周昆
%A 潘志庚
%A 石教英
%J 自动化学报
%D 1999
%I 
%X In computer graphics,models are often discribed by polygonal meshes.Because the rendering and storage cost is proportional to the number of polygons,too large models are not practical.Model simplification techniques are widely used in computer graphics fields such as computer animation,virtual reality and interactive scientific visualization.In this paper a new algorithm of mesh simplification based on vertex clustering is presented.The algorithm adopts octree structure to subdivide the mesh model adaptively.A new error control method is also presented.The implementation of the algorithm is simple and it runs very fast.Examples illustrate the efficiency of the algorithm.
%K Polygonal mesh
%K mesh simplification
%K vertex cluster
%K level of detail<br>多边形网格
%K 网格简化
%K 顶点聚类
%K 计算机图形学
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=6074A50562A5545A5C92877C5B7E1C96&yid=B914830F5B1D1078&vid=C5154311167311FE&iid=CA4FD0336C81A37A&sid=CA4FD0336C81A37A&eid=5D311CA918CA9A03&journal_id=0254-4156&journal_name=自动化学报&referenced_num=21&reference_num=3