Implementation of linear minimum area enclosing triangle algorithm. Application note

DOI10.1007/s40314-014-0198-8zbMath1409.68309OpenAlexW2125179545WikidataQ59474935 ScholiaQ59474935MaRDI QIDQ2013616

Ovidiu Pârvu, David Gilbert

Publication date: 8 August 2017

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-014-0198-8

zbMATH Keywords

convex polygoncomputational geometrybenchmarkminimum area trianglerotating caliper

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Generalized \(C^1\) Clough-Tocher splines for CAGD and FEM ⋮ Optimal Embedded and Enclosing Isosceles Triangles ⋮ On stable representations of Bell elements

Uses Software

• CGAL
• OpenCV

Cites Work

• Finding the smallest triangles containing a given convex polygon
• An optimal algorithm for finding minimal enclosing triangles
• A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
• The computational geometry algorithms library CGAL

This page was built for publication: Implementation of linear minimum area enclosing triangle algorithm. Application note