Barry,

I looked at your code and I wondered if it would not be more convenient to
find the closest point on a an edge rather than the closest vertex?

In this case, what technique would be the best? I thought of
spatstat::project2Segment that I used in my script (but Edzer says it
doesn't work - I have to check that)


Mathieu


2012/9/10 Mathieu Rajerison <mathieu.rajerison@gmail.com>

> It looks really nice.
>
> Thanks Barry!
>
>
> 2012/9/9 Barry Rowlingson <b.rowlingson@lancaster.ac.uk>
>
>> I've just pushed a cleanup and a bunch of examples to RPubs:
>>
>> http://rpubs.com/geospacedman/routing
>>
>>  It uses the latest igraph!
>>
>>  It's all there, building the network and routing and plotting.
>>
>> Barry
>>
>> _______________________________________________
>> R-sig-Geo mailing list
>> R-sig-Geo@r-project.org
>> https://stat.ethz.ch/mailman/listinfo/r-sig-geo
>>
>
>

	[[alternative HTML version deleted]]

