In this packetization scheme, we firstly construct a non-redundant directed acyclic graph (DAG) encoding the dependencies among the entire vertex split operations of the progressive mesh.

• 摘要提出一种快速有效的非冗余依赖图构建算法，记录所有网格顶点分裂操作之间的依赖关系，并删除其中的冗余依赖。