Counterexamples to a minimal circumscription algorithm
- 30 June 1985
- journal article
- research article
- Published by Elsevier in Computer Vision, Graphics, and Image Processing
- Vol. 30 (3), 364-366
- https://doi.org/10.1016/0734-189x(85)90167-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- An optimal algorithm for finding minimal enclosing trianglesJournal of Algorithms, 1986
- Finding the smallest triangles containing a given convex polygonJournal of Algorithms, 1985
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area additionComputer Vision, Graphics, and Image Processing, 1983