On implementation of the minimal perimeter triangle enclosing a convex polygon algorithm

TL;DR

This paper provides a modern, complete, and robust implementation of a linear-time algorithm for finding the minimal perimeter triangle enclosing a convex polygon, addressing previous incomplete implementations.

Contribution

It offers a comprehensive, updated treatment and implementation of the minimal perimeter triangle algorithm for convex polygons, including common case handling.

Findings

The implementation runs in linear time.

It handles all common cases robustly.

Provides a clear, modern algorithm description.

Abstract

A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work. However, that implementation is incomplete and omits certain common cases. This note's contribution consist of a modern treatment of the algorithm and its consequent simple and robust implementation.