org.opentripplanner.graph_builder.linking

Class SimpleStreetSplitter

java.lang.Object

org.opentripplanner.graph_builder.linking.SimpleStreetSplitter

public class SimpleStreetSplitter
extends Object

This class links transit stops to streets by splitting the streets (unless the stop is extremely close to the street intersection). It is intended to eventually completely replace the existing stop linking code, which had been through so many revisions and adaptations to different street and turn representations that it was very glitchy. This new code is also intended to be deterministic in linking to streets, independent of the order in which the JVM decides to iterate over Maps and even in the presence of points that are exactly halfway between multiple candidate linking points. It would be wise to keep this new incarnation of the linking code relatively simple, considering what happened before. See discussion in pull request #1922, follow up issue #1934, and the original issue calling for replacement of the stop linker, #1305.

Field Summary

Fields

Modifier and Type	Field and Description
static double	DUPLICATE_WAY_EPSILON_METERS if there are two ways and the distances to them differ by less than this value, we link to both of them
static int	MAX_SEARCH_RADIUS_METERS
static int	WARNING_DISTANCE_METERS

Constructor Summary

Constructors

Constructor and Description
SimpleStreetSplitter(Graph graph) Construct a new SimpleStreetSplitter.
SimpleStreetSplitter(Graph graph, HashGridSpatialIndex<Edge> hashGridSpatialIndex, com.vividsolutions.jts.index.SpatialIndex transitStopIndex, boolean destructiveSplitting) Construct a new SimpleStreetSplitter.

Method Summary

Modifier and Type	Method and Description
Boolean	getAddExtraEdgesToAreas()
Vertex	getClosestVertex(GenericLocation location, RoutingRequest options, boolean endVertex) Used to link origin and destination points to graph non destructively.
void	link() Link all relevant vertices to the street network
boolean	link(Vertex vertex) Link this vertex into the graph to the closest walkable edge
boolean	link(Vertex vertex, TraverseMode traverseMode, RoutingRequest options) Link this vertex into the graph
void	setAddExtraEdgesToAreas(Boolean addExtraEdgesToAreas)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

MAX_SEARCH_RADIUS_METERS

public static final int MAX_SEARCH_RADIUS_METERS

See Also:

Constant Field Values

WARNING_DISTANCE_METERS

public static final int WARNING_DISTANCE_METERS

See Also:

Constant Field Values

DUPLICATE_WAY_EPSILON_METERS

public static final double DUPLICATE_WAY_EPSILON_METERS

if there are two ways and the distances to them differ by less than this value, we link to both of them

See Also:

Constant Field Values

Constructor Detail

SimpleStreetSplitter

public SimpleStreetSplitter(Graph graph,
                            HashGridSpatialIndex<Edge> hashGridSpatialIndex,
                            com.vividsolutions.jts.index.SpatialIndex transitStopIndex,
                            boolean destructiveSplitting)

Construct a new SimpleStreetSplitter. NOTE: Only one SimpleStreetSplitter should be active on a graph at any given time.

Parameters:

hashGridSpatialIndex - If not null this index is used instead of creating new one

transitStopIndex - Index of all transitStops which is generated in StreetVertexIndexServiceImpl

destructiveSplitting - If true splitting is permanent (Used when linking transit stops etc.) when false Splitting is only for duration of a request. Since they are made from temporary vertices and edges.

SimpleStreetSplitter

public SimpleStreetSplitter(Graph graph)

Construct a new SimpleStreetSplitter. Be aware that only one SimpleStreetSplitter should be active on a graph at any given time. SimpleStreetSplitter generates index on graph and splits destructively (used in transit splitter)

Parameters:

graph -

Method Detail

link

public void link()

Link all relevant vertices to the street network

link

public boolean link(Vertex vertex)

Link this vertex into the graph to the closest walkable edge

link

public boolean link(Vertex vertex,
                    TraverseMode traverseMode,
                    RoutingRequest options)

Link this vertex into the graph

getClosestVertex

public Vertex getClosestVertex(GenericLocation location,
                               RoutingRequest options,
                               boolean endVertex)

Used to link origin and destination points to graph non destructively. Split edges don't replace existing ones and only temporary edges and vertices are created. Will throw ThrivialPathException if origin and destination Location are on the same edge

Parameters:

location -

options -

endVertex - true if this is destination vertex

Returns:

getAddExtraEdgesToAreas

public Boolean getAddExtraEdgesToAreas()

setAddExtraEdgesToAreas

public void setAddExtraEdgesToAreas(Boolean addExtraEdgesToAreas)