Publication Details
Title: On Finding a Minimal Enclosing Parallelgram
Author: C. Schwarz, J. Teich, E. Welzl, and B. Evans
Group: ICSI Technical Reports
Date: August 1994
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1994/tr-94-036.pdf
Overview:
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 Information:
ICSI Technical Report TR-94-036
Bibliographic Reference:
C. Schwarz, J. Teich, E. Welzl, and B. Evans. On Finding a Minimal Enclosing Parallelgram. ICSI Technical Report TR-94-036, August 1994
Author: C. Schwarz, J. Teich, E. Welzl, and B. Evans
Group: ICSI Technical Reports
Date: August 1994
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1994/tr-94-036.pdf
Overview:
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 Information:
ICSI Technical Report TR-94-036
Bibliographic Reference:
C. Schwarz, J. Teich, E. Welzl, and B. Evans. On Finding a Minimal Enclosing Parallelgram. ICSI Technical Report TR-94-036, August 1994