A C++ implementation of the minimal area enclosing triangle algorithm.
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
bin
build
cmake/modules
data
extern
include/triangle
lib
modules
script
.cproject
.project
CMakeLists.txt
README.md

README.md

Minimal area enclosing triangle implementation

This project contains C++ implementations of brute-force cubic and linear time algorithms for computing the minimal area triangles enclosing a set of 2D points. Different tests were designed and implemented to verify the correctness of the linear time algorithm implementation.

For more details please visit the official website or contact me.