Implementation of linear minimum area enclosing triangle algorithm. Application note
DOI10.1007/S40314-014-0198-8zbMATH Open1409.68309OpenAlexW2125179545WikidataQ59474935 ScholiaQ59474935MaRDI QIDQ2013616FDOQ2013616
Authors: 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
Recommendations
- An optimal algorithm for finding minimal enclosing triangles
- scientific article; zbMATH DE number 1947421
- A new algorithm for the minimal-area convex enclosure problem
- Computing minimum-area rectilinear convex hull and \(L\)-shape
- A linear time algorithm for max-min length triangulation of a convex polygon
- On a linear program for minimum-weight triangulation
- On a linear program for minimum-weight triangulation
- scientific article; zbMATH DE number 781253
- Algorithms for optimal area triangulations of a convex polygon
- scientific article; zbMATH DE number 1305489
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
Cited In (4)
Uses Software
This page was built for publication: Implementation of linear minimum area enclosing triangle algorithm. Application note
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013616)