An algorithm which computes the minimum area triangle enclosing a convex polygon in linear time already exists in the literature. The paper describing the algorithm also proves that the provided solution is optimal and a lower complexity sequential algorithm cannot exist. However, only a high-level description of the algorithm was provided, making the implementation difficult to reproduce. The present note aims to contribute to the field by providing a detailed description of the algorithm which is easy to implement and reproduce, and a benchmark comprising 10,000 variable sized, randomly generated convex polygons for illustrating the linearity of the algorithm.
CITATION STYLE
Pârvu, O., & Gilbert, D. (2016). Implementation of linear minimum area enclosing triangle algorithm: Application note. Computational and Applied Mathematics, 35(2), 423–438. https://doi.org/10.1007/s40314-014-0198-8
Mendeley helps you to discover research relevant for your work.