Ordered Adjacency Vertex List Structure for Subdivision Surfaces
细分曲面的有序邻接顶点表数据结构

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 .