Simplifying and Optimizing Triangle Meshes

Abstract:

Smoothing is only one of the processes we generally have to apply to acquired geometry. This chapter discusses several other important algorithms connected by virtue of being simple greedy processes where we improve the mesh by local changes to the mesh connectivity. First, we discuss the popular scheme for mesh simplification due to Garland and Heckbert where edges are iteratively contracted according to a cost function stored in a priority queue. Next, we discuss various algorithms for improvement of meshes based on flipping an edge separating two triangles to the other diagonal of the quadrilateral formed by the two triangles. Greedy schemes may again be applied for mesh flip optimization, but we also consider the method of simulated annealing.

Año de publicación:

2012

Keywords:

Fuente:

google