Visual Computer

Paper

01 Aug 1985

Minimum area circumscribing Polygons

View publication

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

Conference paper

Extracting minimum-weight tree patterns from a schema with neighborhood constraints

Benny Kimelfeld, Yehoshua Sagiv

ICDT 2013

Paper

On Seeing Spaghetti: Self-Adjusting Piecewise Toroidal Recognition of Flexible Extruded Objects

John R. Kender, Rick Kjeldsen

IEEE Transactions on Pattern Analysis and Machine Intelligence

Conference paper

DFlow and DField: New features for capturing object and image relationships

Pavel Kisilev, Daniel Freedman, et al.

ICPR 2012

Paper

Ground from figure discrimination

Arnon Amir, M. Lindenbaum

Computer Vision and Image Understanding

View all publications