Skip to content
Prev 1884 / 29559 Next

agenda for R's Geo capabilities?

On 3/16/07, elw at stderr.org <elw at stderr.org> wrote:
Our approach is not to store the vertex/edge information in the graph
library, but rather to model it with iterator interfaces. Generic
programming methods make this possible. Essentially, GDAL becomes the
data storage mechanism and the graph is implicit. The limits in this
case are likely the algorithmic complexity rather than data storage
(the step of building a graph data structure is entirely avoided). Of
course there may be better alternatives that are custom built for the
problem.

Vertex/edge iterators could also be backed by postgis or any other
data source with sufficient structure to specify adjacency. The
enormous value from my perspective is that effort coding algorithms
becomes reusable in many contexts.

THK
I've never heard of it, but like I say, this is pretty far from my core areas.

THK