Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uwm.edu!rpi!welch
From: welch@ral.rpi.edu (Henry Welch)
Newsgroups: comp.graphics
Subject: Re: Minimum bounding region
Keywords: rectangles region bounding
Message-ID: <2C5#SX#@rpi.edu>
Date: 4 May 90 15:34:41 GMT
References: <1094@media01.UUCP>
Organization: Rensselaer Polytechnic Institute, Troy NY
Lines: 22

In article <1094@media01.UUCP> pkr@media01.UUCP (Peter Kriens) writes:
>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.

I'm not sure of all your requirements with regard to the outline of
the region, but here is a  suggestion.

Record all the vertices of your rectangles and generate the convex
hull of the points.

====> Henry

<><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>
Doctoral Candidate - Robotics and Automation Laboratory
                     Center for Intelligent Robotics for Space Exploration
                     Rensselaer Polytechnic Institute
                     welch@ral.rpi.edu
<><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>
Life's a bitch and then you're reincarnated!