Thanks, Michael.
I'm not sure there's any easy lesson for JTS here - except maybe that
generics are a nice thing to have for graph libraries!
Michaël Michaud wrote:
Hi Martin,
I agree with your experience that it's just as reasonable to work at
the feature level rather than the geometry lev
Hi Martin,
I agree with your experience that it's just as reasonable to work at
the feature level rather than the geometry level. Graph-based
algorithms are pretty much orthogonal to geometric algorithms, so
there's not much to be gained from having the graph "know" about the
geometry. The
Michael,
I agree with your experience that it's just as reasonable to work at the
feature level rather than the geometry level. Graph-based algorithms
are pretty much orthogonal to geometric algorithms, so there's not much
to be gained from having the graph "know" about the geometry. The one
Hi,
I have used JGraphT with JTS for a while and I can say it is *very* fast.
I use it to find nodes of a linear network, degree* of each node, cycles...
When using JTS+JGraphT, I consider linear features as the edges of the
graph and first and last coordinates of their geometry as the nodes. It
I think Michael Michaud also used JgraphT for his OpeJUMP Plugin:
http://geo.michaelm.free.fr/OpenJUMP/resources/jump-jgrapht-0.3.jar
http://geo.michaelm.free.fr/OpenJUMP/resources/jump-jgrapht-src-0.3.zip
but maybe it is already what you meant with JUMP plugin
stefan
__
Thanks, Michael. I've added this to JTS 1.11. This is crying out for
a unit test - so I've added one of those as well.
Michael Bedward wrote:
oops - sorry, here is the patch again without the spurious line at the top...
2009/3/8 Michael Bedward :
Hi Martin and everyone,
Angle.normalize
LineMergeGraph inherits the add(Node) method from PlanarGraph.
But I would look at using PlanarGraph, not LineMergeGraph. LMG is
specifically intended for line merging, which is probably not what
you're trying to do.
If all you have is Coordinates and LineStrings, then you should be able
to
Johnathan Kool wrote:
I've managed to work out a visibility algorithm based on Coordinates,
Geometry obstacles and LineString paths, but now need to construct a graph
so I can run a Dijkstra search (or A*). Essentially, I have a collection of
Coordinates/Nodes, and LineStrings representing 'all
