This project implements a mesh simplification algorithm using edge collapse and the Quadric Error Metric (QEM), built upon a custom half-edge data structure. It supports three modes of simplification:
Efficient mesh representation with support for fast adjacency queries.
Validates and collapses a single edge while preserving manifoldness. Used for debugging and small-step testing.
Repeatedly collapses the shortest valid edge. Includes edge cost updates and visualization of the collapse priority.
Implements full QEM for optimal vertex placement and edge cost. Solves a 4x4 linear system for each collapse using a provided numerical solver.
