comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Q: Given many images, find biggerest bounding box
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Q: Given many images, find biggerest bounding box [message #17633] Fri, 05 November 1999 00:00
hhpt is currently offline  hhpt
Messages: 3
Registered: August 1999
Junior Member
I have many spatially seperated (but maybe overlapped) images patches
which I would like to make a big mosaic image with them.

For each of the patch, I have the coor. (lat, lon) of the upper left
hand corner and the # of rows and # of cols. I would like to find the
biggerest bounding box that will contain all the patches.

Can anyone point me to any existing algorithm that will find this
bounding box?

-- Herbert


Sent via Deja.com http://www.deja.com/
Before you buy.
[Message index]
 
Read Message
Previous Topic: Re: idl emacs question
Next Topic: Xinteranimate "Unable to create pixmap" error

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Fri Oct 10 22:44:35 PDT 2025

Total time taken to generate the page: 0.56098 seconds