(near future scenario) I have a lot of piddles covering contiguous rectangular areas. I could stitch them up together, but then, I would have a one very large piddle. So, I leave them the way they are. The user supplies a pair of coordinate pairs which lets me identify the piddle we want, open it up, use range() to extract the area-of-interest (AOI), and analyze it. I can do the identification of the piddle either based on some naming scheme I can develop, or by storing some kind of area->to->name index. (sidenote: Of course, I can do this identification task with PostGIS/Postgres, or with SQLite+R*Tree, but I am hoping for an all PDL solution, or rather, a NoSQL solution). So, that is the first problem... a name->to->area index is easy, but an arbitrary_area->to->name index is difficult.
Second problem -- what if the arbitrary_area->to->name index returns multiple piddles, as in, an AOI that overlaps several piddles? So, first, the aribitrary_area->to->name index should be able to return multiple piddles. Then, my program should be able to extract the various smaller regions from the identified piddles and glue (or append) them together into a piddle of the AOI, cache it temporarily, and do analysis on it. I am thinking... this could be done with some kind of quad-tree indexing scheme. Has this been done already? If not, suggestions on how to proceed with this would be much welcome. -- Puneet Kishor http://www.punkish.org Carbon Model http://carbonmodel.org Charter Member, Open Source Geospatial Foundation http://www.osgeo.org Science Commons Fellow, http://sciencecommons.org/about/whoweare/kishor Nelson Institute, UW-Madison http://www.nelson.wisc.edu ----------------------------------------------------------------------- Assertions are politics; backing up assertions with evidence is science ======================================================================= _______________________________________________ Perldl mailing list [email protected] http://mailman.jach.hawaii.edu/mailman/listinfo/perldl
