Dragutin Petkovic, Wayne Niblack, et al.
Machine Vision and Applications
Paper
Minimum area circumscribing Polygons
Abstract
We show that the smallest k-gon circumscribing a convex n-gon can be computed in O(n2 log n log k) time. © 1985 Springer-Verlag.
Related
Konstantinos Tarabanis, Roger Y. Tsai, et al.
Computer Vision and Image Understanding
Conference paper
EPAComp: An Architectural Model for EPA Composition
Luís Henrique Neves Villaça, Sean Wolfgand Matsui Siqueira, et al.
SBSI 2023
Eli Packer, Asaf Tzadok, et al.
ICDAR 2011