An optimal algorithm for finding minimal enclosing triangles
- 30 June 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (2), 258-269
- https://doi.org/10.1016/0196-6774(86)90007-6
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Finding the smallest triangles containing a given convex polygonJournal of Algorithms, 1985
- Counterexamples to a minimal circumscription algorithmComputer Vision, Graphics, and Image Processing, 1985
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area additionComputer Vision, Graphics, and Image Processing, 1983