On Fri, Aug 31, 2012 at 9:39 AM, Mathieu Rajerison
mathieu.rajeri...@gmail.com wrote:
Hi,
I've got a question which is graph-related.
Let's suppose I have a linear network.
I cut the lines at the intersections and get some vertexes and edges
connecting them
How can I turn this into a
Wow, I'm really impressed by your geohacking skills. Thanks a lot.
Yes, there is a GRASS::v.clean function that cuts lines.
Also, GRASS already includes allocation algorithms.
We could also imagine performing shortest path calculations for extra
vertexes that aren't initally on the graph: shop
Am 31.08.2012 17:52, schrieb Alok K Bohara, PhD:
I am learning to layer different shape files. In particular one
shapefile --with point patterns-- does not have any projection info (it
says NULL). The other State county file has projection info. Both data
come from the same state (New Mexico). I
Hi,
I need to calculate the great circle distances between consecutive
coordinates.
Let's say:
lon - c(-115.8667, -115.8667, -115.8583, -115.8500, -115.8500,
-115.8500, -115.8444, -115.8389, -115.8333, -115.8333, -115.8333)
lat - c( 29.76670, 29.76670, 29.74170, 29.71670, 29.71670,
