Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (20): 62-64.

• 学术探讨 • Previous Articles     Next Articles

Fast mesh simplification algorithm based on edge-collapse

MENG Jun,SONG Lei   

  1. Department of Computer Science and Engineering,Dalian University of Technology,Dalian,Liaoning 116023,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-11 Published:2007-07-11
  • Contact: MENG Jun


孟 军,宋 磊   

  1. 大连理工大学 计算机科学与工程系,辽宁 大连 116023
  • 通讯作者: 孟 军

Abstract: 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.

Key words: mesh simplification, edge-collapse, priority queue, quadric error

摘要: 根据Garland的QEM算法提出了一种快速的网格模型简化算法。算法使用顶点权值来表示顶点的重要程度,顶点权值可以将收缩的边所影响的范围控制在较小的区域内;顶点的权值被存储在一个优先权队列中并且利用优先权队列来控制边收缩的顺序,顶点的优先权队列所存储的元素比较少并且易于维护。该算法实现容易、执行速度快。

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