On Finding a Minimal Enclosing Parallelgram

TitleOn Finding a Minimal Enclosing Parallelgram
Publication TypeTechnical Report
Year of Publication1994
AuthorsSchwarz, C., Teich J., Welzl E., & Evans B.
Other Numbers906

Given a convex polygon C with n vertices, we show how a parallelogram with minimal area enclosing C can be computed in linear time O(n). The problem is of interest in digital signal processing.

Bibliographic Notes

ICSI Technical Report TR-94-036

Abbreviated Authors

C. Schwarz, J. Teich, E. Welzl, and B. Evans

ICSI Publication Type

Technical Report