摘要
根据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.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第20期62-64,116,共4页
Computer Engineering and Applications
关键词
网格简化
边收缩
优先权队列
二次误差
mesh simplification
edge-collapse
priority queue
quadric error
