Skip to main content
Research
Visual Computer
Paper

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

The hyperbox

Bowen Alpern, Larry Carter

VIS 1991

View all publications