基于边收缩的快速网格简化算法  

Fast mesh simplification algorithm based on edge-collapse

作　　者：孟军[1] 宋磊[1] 

机构地区：[1]大连理工大学计算机科学与工程系,辽宁大连116023

出　　处：《计算机工程与应用》2007年第20期62-64,116,共4页Computer Engineering and Applications

摘　　要：根据Garland的QEM算法提出了一种快速的网格模型简化算法。算法使用顶点权值来表示顶点的重要程度,顶点权值可以将收缩的边所影响的范围控制在较小的区域内;顶点的权值被存储在一个优先权队列中并且利用优先权队列来控制边收缩的顺序,顶点的优先权队列所存储的元素比较少并且易于维护。该算法实现容易、执行速度快。A fast mesh simplification algorithm based on Garland＇s QEM is introduced.Vertex weight is presented to express the significance of a vertex.Vertex weight can restrict the region affected by edge collapse in a small area.A priority queue containing the weight of all vertices is utilized to control the sequence of edge collapse.This algorithm is easy to be implemented and its cost of time is much lower.

关 键 词：网格简化 边收缩 优先权队列 二次误差 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]