Quadric-based Mesh Decimation Via Multiple Choices Algorithm
This code is the impelementation of a mesh decimation algorithm based on the quadric-based errors with winged edge data structure. Since the input mesh is assumed as a closed manifold triangle mesh, I've implemented only edge collapse, not vertex pair collapse. Multiple choice scheme is used for the outer optimization.
This code is implemented based on two papers:"Surface Simplification Using Quadric Error Metrics",and "Fast Mesh Decimation by Multiple-Choice Techniques". Also, NanoGUI is used to render the object, the first sample codes for nanugui is provided by Wallace Lira but most of them are modified in this code.
This code is implemented with C++11 and tested on Linux 16.04. Nanogui is already included in this code directory.
cd <path-to-folder>
cmake .
make
./mcaq
you can import example meshes from ./objs directory using NanoGUI interface.
Before decimation,
After decimation,
Suhong Kim – @github – suhongkim11@gmail.com
Distributed under the MIT license. See the LICENSE.md file for details
This project is done for CMPT764 "Geometry Modeling in Computer Graphics"(Spring2019) at SFU.