The match_pts_to_graph function matches points to the nearest edge based on geometric intersections; this function only matches to the nearest vertex based on point-to-point distances.
Arguments
- verts
A
data.frame
of vertices obtained fromdodgr_vertices(graph)
.- xy
coordinates of points to be matched to the vertices, either as matrix or sf-formatted
data.frame
.- connected
Should points be matched to the same (largest) connected component of graph? If
FALSE
and these points are to be used for adodgr
routing routine (dodgr_dists, dodgr_paths, or dodgr_flows_aggregate), then results may not be returned if points are not part of the same connected component. On the other hand, forcing them to be part of the same connected component may decrease the spatial accuracy of matching.
See also
Other match:
add_nodes_to_graph()
,
match_points_to_graph()
,
match_pts_to_graph()
,
match_pts_to_verts()
Examples
net <- weight_streetnet (hampi, wt_profile = "foot")
verts <- dodgr_vertices (net)
# Then generate some random points to match to graph
npts <- 10
xy <- data.frame (
x = min (verts$x) + runif (npts) * diff (range (verts$x)),
y = min (verts$y) + runif (npts) * diff (range (verts$y))
)
pts <- match_pts_to_verts (verts, xy)
pts # an index into verts
#> [1] 3053 3053 260 11 3080 1150 3076 1738 1209 1710
pts <- verts$id [pts]
pts # names of those vertices
#> [1] "7769190961" "7769190961" "339574191" "2398958016" "1204772830"
#> [6] "1376769061" "1204772868" "7793361780" "7799711030" "2588146016"