%0 Journal Article
%T Ordered Adjacency Vertex List Structure for Subdivision Surfaces<br>细分曲面的有序邻接顶点表数据结构
%A WANG Lei
%A HAN Zhen
%A SHI Yin
%A <br>王磊
%A 韩臻
%A 施寅
%J 计算机应用研究
%D 2004
%I 
%X Generally,the data structure for implementation of subdivision surfaces is based on edge structure,which Provides a general method of traversing the mesh.However,for subdivision,it is more natural to consider data structures with representations for faces and vertices,not for edges.In this paper,OAVL structure is proposed for convenient implementation of subdivision.Through this structure,the connectivity of mesh can be found more easily.In addition,OAVL structure has a more efficient storage.Finally,the storage of mesh based on OAVL is analyzed .
%K Subdivision Surface
%K Mesh
%K Data Structure
%K OAVL (Ordered Adjacency Vertex List)<br>细分曲面
%K 网格
%K 数据结构
%K 有序邻接顶点表
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=AE7F67FEB9F7C13A&yid=D0E58B75BFD8E51C&vid=659D3B06EBF534A7&iid=9CF7A0430CBB2DFD&sid=C36EC077A8A90308&eid=C3BF5C58156BEDF0&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=3&reference_num=4