Connecting origins and destinations to the network

(outline, to be written out)

Origins and destinations are points in space, and the network is a graph. Joining the two is done with connector links, also called OD connection roads, and the way they are created is a frequent source of implausible results. A dwelling connected to the wrong side of a motorway can be minutes away from its actual neighbourhood.

Planned contents

• Snapping: the connect operator, nearest link versus nearest node, and why nearest node snapping distorts short distances
• Connector impedance: charging the connector at walking speed rather than at the speed of the link it attaches to
• Restricting valid connections: preventing connections to motorways, tunnels and other links with no local access
• Multiple connectors per point: when one connector is not enough, and the cost of allowing several
• Protecting connectors during network reduction: why OD connection nodes are excluded from deletion in the Network optimisation algorithm
• Diagnostics: the distribution of connector lengths as a quality check on both the network and the point set

Related

• Zoning and spatial units, choosing the points in the first place
• Building a routable network
• Network optimisation algorithm