This repository contains the implementation of a linear-time greedy algorithm for near-optimal MWT of convex polygons, as described in the paper "A Linear-Time Greedy Algorithm with Directional Optimization for Near-Optimal Minimum Weight Triangulation of Convex Polygons".

• Run experiments.py to reproduce results.
• Requirements: Python 3.x, NumPy, time.

If using this code, cite the paper.