|
Posted by Martin Hvidberg on May 25, 2005, 7:16 pm
Please log in for more thread options
> Many questions have been asked and answered concerning the shortest
> distance (spherical) between two points in lat/long. I wish to seek
> your help/information about efficient algorithms for spherical distance
> buffering.
>
> In a grid environment, two choices one can quickly come up are as
> follows -
>
> (1) to define a moving window with a given size first and then to
> search the shortest distance between a pixel location and all
> surrounding pixels within the defined window.
>
> (2) to make the first method faster, one could use the connectivity of
> neighbouring pixels to avoid full window-based searching.
>
> Do you have any information (e.g., references, websites, etc.) on the
> topic for sharing? Thanks.
If I get you right you might find help on:
http://williams.best.vwh.net/avform.htm
:-) Martin
| 
XML Sitemap