Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!cs.utexas.edu!wuarchive!uunet!mcsun!hp4nl!media01!pkr
From: pkr@media01.UUCP (Peter Kriens)
Newsgroups: comp.graphics
Subject: Minimum bounding region
Keywords: rectangles region bounding
Message-ID: <1094@media01.UUCP>
Date: 4 May 90 08:01:54 GMT
Organization: Mediasystemen, Netherlands
Lines: 20

For some people this is probably a very simple problem,
but I haven't found a very elegant solution yet.

We need to have a path that describes the minimum region
in which a set of n rectangles will fit. The path should
be described with points which can followed to draw the
outline of the region. The rectangles can, but do not always
connect, and sometimes they even overlap.

Does anyone have a nice clean elegant algorithm that handles
this problem? Or a reference to a book?

Thanks for your trouble

Peter Kriens
pkriens@media01
Mediasystemen		Tel 31-23-319075 
Waarderweg 18
PostBox 4932
2003 EX Haarlem