A progressive mesh is a data structure which is created as the original model of the best quality simplifies a suitable decimation algorithm, which removes step by step some of the edges in the model (edge-collapse operation). It is necessary to undertake as many simplifications as needed to achieve the minimal model. The resultant model, in a full quality, is then represented by the minimal model and by the sequence of inverse operations to simplistic (vertex split operation). This forms a hierarchical structure which helps to create a model in the chosen level of detail.
This simplistic operation - ecol takes two connected vertices and replaces them with a single vertex. Two triangles {vs, vt, vl} and {vt, vs, vr} which were connected by the edge are also removed during this operation.
Vertex split (vsplit) is the inverse operation to the edge collapse that divides the vertex into two new vertices. Therefore, a new edge {vt, vs} and two new triangles {vs, vt, vl} and {vt, vs, vr} arise.
Hoppe, Hugues (1996). "Progressive meshes". Proceedings of the 23rd annual conference on Computer graphics and interactive techniques. New York, New York, USA: ACM Press. pp. 99–108. doi:10.1145/237170.237216. ISBN 0-89791-746-4. S2CID 1490953. 0-89791-746-4 ↩
D. Luebke, M. Reddy, J. D. Cohen, A. Varshney, B. Watson, R. Huebner: Level of Detail for 3D Graphics, Morgan Kaufmann, 2002, ISBN 0-321-19496-9 /wiki/ISBN_(identifier) ↩