I am working with GPS tracks (lat/lon values) and my goal is to compute the minimum bounding box for a small geospatial library I am working on. The datasets are not huge, maybe a couple of tens of thousands of points. I could not find an algorithm that deals with tracks/datasets crossing from -180 to 180 lat or lon. Does anybody have pointers to algorithms?
As a bonus question, it also would be great to "join" these bounding boxes once I have them. So once I have the bounding boxes for 5 GPS tracks, how can I find the bounding box for all of them, again handling -180/180 issues correctly.
The background for me is that I need the bounding boxes to initialize map viewers, in particular when there is more than one track displayed on a map. Thanks!
أكثر...
As a bonus question, it also would be great to "join" these bounding boxes once I have them. So once I have the bounding boxes for 5 GPS tracks, how can I find the bounding box for all of them, again handling -180/180 issues correctly.
The background for me is that I need the bounding boxes to initialize map viewers, in particular when there is more than one track displayed on a map. Thanks!
أكثر...