Work

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

Year: 2016

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1606.02098

Author: Ermolaev, V.

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2415998489

Cites: 3

Cited by:

Related to: 10