An implementation of the algorithm given in the paper This is an improved implementation as compared to the one described here. The main difference is that the former implementation fails whenever a polygon contains a vertical edge, this is robust w.r.t. the vertucal edges.
npm install
gulp
gulp demo
Note: running demo will require administrator privileges to create symlinks from web directory to an html page in source
Demo is contained in web/demo/showcase.html.
Data for examples are taken from the minimum area enclosing triangle
repository
After having build, start PowerShell and execute build\performance\measurements.ps1
You may want to adjust the parameters of the evaluation in the script
Script will generate a number of logs which can be analysed in Mathematica notebook build\performance\evaluate.nb
MIT License