hello Rinus,
You can find the answer in section 2.09 here:
http://www.faqs.org/faqs/graphics/algorithms-faq/
It involves calculating the convex hull and then testing the area of each
rectangle that uses one of the lines of the hull.
More details here:
http://cgm.cs.mcgill.ca/~orm/rotcal.frame.html
More recent versions of MapInfo has convex hull built-in, otherwise you can
find it in our ToolBox (see my signature).
Kind regards
Uffe Kousgaard
www.routeware.dk
----- Original Message -----
From: "Rinus Deurloo" <[EMAIL PROTECTED]>
To: <[email protected]>
Sent: Thursday, October 13, 2005 9:46 AM
Subject: MI-L smallest enclosing rectangular box
Dear all,
Does any one know a fast algorithm for calculating the smallest enclosing
rectangular box around a region? I do not mean the MBR, because often this
is not the smallest, due to its fixed north-south orientation. I mean the
box that is independent of orientation.
Thanks in advance.
Rinus Deurloo
University of Amsterdam
Dept. of Geography and Planning
The Netherlands.
---------------------------------------------------------------------
List hosting provided by Directions Magazine | www.directionsmag.com |
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
Message number: 18249
---------------------------------------------------------------------
List hosting provided by Directions Magazine | www.directionsmag.com |
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
Message number: 18251
