keyword

edge collapse

Edge collapse is a geometric operation used in 3D mesh processing and computer graphics to simplify polygonal surfaces by merging two adjacent vertices into a single vertex. During this operation, the shared edge connecting the two vertices is removed along with the adjacent degenerate faces, while the remaining neighboring faces are reconnected to the newly formed or relocated vertex. This local transformation reduces the overall number of polygons, vertices, and edges in a model, serving as a primary mechanism in mesh decimation algorithms to optimize rendering performance and reduce data size while preserving the underlying shape and topology of the original object.

1 item

Mesh optimization

Hugues Hoppe, T. DeRose, T. Duchamp, J. McDonald, W. Stuetzle

OrganizationsUniversity of Washington

Why you should read this

Develops an energy-minimization framework that jointly optimizes mesh connectivity and vertex positions to accurately fit 3D point sets while reducing geometric complexity, recovering sharp features for both surface reconstruction and mesh simplification.

We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same topological type as M0, that fits the data well and has a small number of vertices. Our approach is to minimize an energy function that explicitly models the competing desires of conciseness of representation and fidelity to the data. We show that mesh optimization can be effectively used in at least two applications: surface reconstruction from unorganized points, and mesh simplification (the reduction of the number of vertices in an initially dense mesh of triangles).

Source

https://dl.acm.org/doi/pdf/10.1145/166117.166119

Added

2026-09-24