fr.ign.cogit.cartagen.graph

Class RelativeNeighbourhoodGraph

Object

Graph

RelativeNeighbourhoodGraph

All Implemented Interfaces:

IGraph

public class RelativeNeighbourhoodGraph
extends Graph

Constructor Summary

Constructors

Constructor and Description
RelativeNeighbourhoodGraph(String name, boolean oriented)
RelativeNeighbourhoodGraph(String name, boolean oriented, Set<IFeature> features)

Method Summary

Modifier and Type	Method and Description
void	buildRNGraph(Set<IFeature> features) Literal implementation of the relative neighbourhood graph computation, it is not efficient at all.
void	buildRNGraph2(Set<IFeature> features) Same as buildRNGraph but the graph is built according to the real geometry of the features and not just the distances between nodes.
void	buildRNGraphFromTriangulation(ITriangulation triGraph) Builds a RN graph from a previously computed Delaunay Triangulation.
boolean	rngBuildEdge1(IDirectPosition node1, IDirectPosition node2, IFeatureCollection<IFeature> nodeFeats) return true if there is no other node inside the circles centred on the two nodes and with a radius equal to the distance between the two nodes
boolean	rngBuildEdge2(Node node1, Node node2, IFeatureCollection<IFeature> nodeFeats) return true if there is no other node inside the circles centred on the two nodes and with a radius equal to the distance between the two nodes

Methods inherited from class Graph

computeCentralities, computeDijkstraShortestPath, cutInConnexParts, equals, getEdgeFromGeoObj, getEdges, getEdgesConnectingNodes, getId, getName, getNodeAt, getNodeFromGeoObj, getNodes, getPaths, hashCode, isOriented, nodeEdgeRatio, setEdges, setId, setName, setNodes, setOriented, setPaths, toString

Methods inherited from class Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

RelativeNeighbourhoodGraph

public RelativeNeighbourhoodGraph(String name,
                                  boolean oriented)

RelativeNeighbourhoodGraph

public RelativeNeighbourhoodGraph(String name,
                                  boolean oriented,
                                  Set<IFeature> features)

Method Detail

buildRNGraph

public void buildRNGraph(Set<IFeature> features)

Literal implementation of the relative neighbourhood graph computation, it is not efficient at all. Should only be used for small sets like the buildings in a block.

Parameters:

features -

buildRNGraph2

public void buildRNGraph2(Set<IFeature> features)

Same as buildRNGraph but the graph is built according to the real geometry of the features and not just the distances between nodes.

Parameters:

features -

rngBuildEdge1

public boolean rngBuildEdge1(IDirectPosition node1,
                             IDirectPosition node2,
                             IFeatureCollection<IFeature> nodeFeats)

return true if there is no other node inside the circles centred on the two nodes and with a radius equal to the distance between the two nodes

Parameters:

coord1 -

coord2 -

Returns:

rngBuildEdge2

public boolean rngBuildEdge2(Node node1,
                             Node node2,
                             IFeatureCollection<IFeature> nodeFeats)

return true if there is no other node inside the circles centred on the two nodes and with a radius equal to the distance between the two nodes

Parameters:

coord1 -

coord2 -

Returns:

buildRNGraphFromTriangulation

public void buildRNGraphFromTriangulation(ITriangulation triGraph)

Builds a RN graph from a previously computed Delaunay Triangulation. This method is much faster than the standard method, particularly when the Delaunay triangulation computation is fast.

Parameters:

triGraph -