Implementation of linear minimum area enclosing triangle algorithm. Application note
type: Item
instance of: scholarly article
title: Implementation of linear minimum area enclosing triangle algorithm. Application note
zbMATH Open document ID: 1409.68309
author: Ovidiu Pârvu
author: David Gilbert
published in: Computational and Applied Mathematics
publication date: 2017-08-08T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6758775
zbMATH Keywords: minimum area triangle
zbMATH Keywords: benchmark
zbMATH Keywords: convex polygon
zbMATH Keywords: rotating caliper
zbMATH Keywords: computational geometry
describes a project that uses: OpenCV
describes a project that uses: CGAL
MaRDI profile type: Publication
full work available at URL: s40314-014-0198-8
OpenAlex ID: W2125179545
Wikidata QID: Q59474935
cites work: The computational geometry algorithms library CGAL
cites work: A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
cites work: Finding the smallest triangles containing a given convex polygon
cites work: An optimal algorithm for finding minimal enclosing triangles
DOI: 10.1007/S40314-014-0198-8
Recommended article: An optimal algorithm for finding minimal enclosing triangles
Recommended article: Q4411390
Recommended article: A new algorithm for the minimal-area convex enclosure problem
Recommended article: Computing minimum-area rectilinear convex hull and \(L\)-shape
Recommended article: A linear time algorithm for max-min length triangulation of a convex polygon
Recommended article: On a Linear Program for Minimum-Weight Triangulation
Recommended article: Q5743438
Recommended article: Q4841044
Recommended article: Algorithms for optimal area triangulations of a convex polygon
Recommended article: Q4252378
description: scientific article; zbMATH DE number 6758775