I can think of a couple of ways you might try and tackle this, but none
of them are going to be easy.
This web page might provide one starting point:
http://cgm.cs.mcgill.ca/~athens/cs507/Projects/2003/DanielSud/ You can
see how complex it is, and that's just for convex polygons, which are
relatively simple case.
Another alternative I'd probably try first is to rasterize the polygon,
and then use some sort of forest-fire-like algorithm to try and find a
maximal rectangular set of pixels within the polygon.
Brian Hamlin wrote:
Hello All-
I spoke with a client recently who wants to use some US County and
US City polys as the basis of some demographics work. He asked for the
polys, bounding boxes on the polys, and a maximum rectangle that would
fit inside the poly. I sid that I had not heard of that before, but I
would look into it.. after (a small amount) of thought, I told him
that there were a lot of difficult or ambiguous cases that would come
up.. So he replied.. ok, just any rectangle that fits in the poly,
trying to be as big as it can be..
So I dont know how I might go about this.. Any ideas?
thanks
-Brian
==
Brian Hamlin
ISDE5 Steering Committee
Planetwork.net
NextNow Collaboratory
_______________________________________________
postgis-users mailing list
[email protected]
http://postgis.refractions.net/mailman/listinfo/postgis-users
--
Martin Davis
Senior Technical Architect
Refractions Research, Inc.
(250) 383-3022
_______________________________________________
postgis-users mailing list
[email protected]
http://postgis.refractions.net/mailman/listinfo/postgis-users
