Surface Simplification Using Quadric Error Metrics

Created on 2023-02-05T05:24:52-06:00

Return to the Index

This card pertains to a resource available on the internet.

This card can also be read via Gemini.

The QSlim algorithm paper.

TODO Read more closely / implement.

Basically works by grouping all vertices in to pairs on an adjacency map and computing a "contraction score" for each pair. This represents some amount of error caused by collapsing the pair.

Pairs are placed in to a heap.

Collapse pairs via the heap until you have reached the desired amount of polygon reduction.