diff --git a/DESCRIPTION b/DESCRIPTION
index 094741e4..afead33b 100644
--- a/DESCRIPTION
+++ b/DESCRIPTION
@@ -1,6 +1,6 @@
 Package: dodgr
 Title: Distances on Directed Graphs
-Version: 0.2.20.026
+Version: 0.2.20.027
 Authors@R: c(
     person("Mark", "Padgham", , "mark.padgham@email.com", role = c("aut", "cre")),
     person("Andreas", "Petutschnig", role = "aut"),
diff --git a/R/match-points.R b/R/match-points.R
index f783d675..ea8adc09 100644
--- a/R/match-points.R
+++ b/R/match-points.R
@@ -231,14 +231,26 @@ signed_intersection_dists <- function (graph, xy, res) {
 #' Insert new nodes into a graph, breaking edges at point of nearest
 #' intersection.
 #'
-#' The "id" value of each edge to be divided through insertion of new points is
-#' modified to produce two new "id" values with suffixes "_A" and "_B". This
-#' routine presumes graphs to be `dodgr_streetnet` object, with geographical
-#' coordinates.
+#' Note that this routine presumes graphs to be `dodgr_streetnet` object, with
+#' geographical coordinates.
+#'
+#' This inserts new nodes by extending lines from each input point to the edge
+#' with the closest point of perpendicular intersection. That edge is then split
+#' at that point of intersection, creating two new edges (or four for directed
+#' edges). If `intersections_only = FALSE` (default), then additional edges are
+#' inserted from those intersection points to the input points. If
+#' `intersections_only = TRUE`, then nodes are added by splitting graph edges at
+#' points of nearest perpendicular intersection, without adding additional edges
+#' out to the actual input points.
+#'
+#' In the former case, the properties of those new edges, such as distance and
+#' time weightings, are inherited from the edges which are intersected, and may
+#' need to be manually modified after calling this function.
 #'
 #' @inheritParams match_pts_to_graph
 #' @param dist_tol Only insert new nodes if they are further from existing nodes
 #' than this distance, expressed in units of the distance column of `graph`.
+#' @param intersections_only If `FALSE`
 #' @return A modified version of `graph`, with additional edges formed by
 #' breaking previous edges at nearest perpendicular intersections with the
 #' points, `xy`.
@@ -258,7 +270,10 @@ signed_intersection_dists <- function (graph, xy, res) {
 #' graph <- add_nodes_to_graph (graph, xy)
 #' dim (graph) # more edges than original
 #' @export
-add_nodes_to_graph <- function (graph, xy, dist_tol = 1e-6) {
+add_nodes_to_graph <- function (graph,
+                                xy,
+                                dist_tol = 1e-6,
+                                intersections_only = FALSE) {
 
     pts <- match_pts_to_graph (graph, xy, distances = TRUE)
     xy <- pre_process_xy (xy)
@@ -360,25 +375,28 @@ add_nodes_to_graph <- function (graph, xy, dist_tol = 1e-6) {
                 edge_i_new <- edge_i # already 2 rows
             }
 
-            # Then add edges out to new point:
-            edge_i_new$from [1] <- edge_i_new$to [2] <- genhash (10L)
-            edge_i_new$xfr [1] <- pts$x0 [i]
-            edge_i_new$yfr [1] <- pts$y0 [i]
-            edge_i_new$xto [2] <- pts$x0 [i]
-            edge_i_new$yto [2] <- pts$y0 [i]
-
-            edge_i_new$d <- d_i
-            edge_i_new$d_weighted <- d_i * d_wt
-            edge_i_new$time <- d_i * t_scale
-            edge_i_new$time_weighted <- edge_i_new$time * t_wt
-
-            edge_i_new$edge_id <- vapply (
-                seq_len (nrow (edge_i_new)),
-                function (i) genhash (10),
-                character (1L)
-            )
+            if (!intersections_only) {
+
+                # Then add edges out to new point:
+                edge_i_new$from [1] <- edge_i_new$to [2] <- genhash (10L)
+                edge_i_new$xfr [1] <- pts$x0 [i]
+                edge_i_new$yfr [1] <- pts$y0 [i]
+                edge_i_new$xto [2] <- pts$x0 [i]
+                edge_i_new$yto [2] <- pts$y0 [i]
 
-            edge_i <- rbind (edge_i, edge_i_new)
+                edge_i_new$d <- d_i
+                edge_i_new$d_weighted <- d_i * d_wt
+                edge_i_new$time <- d_i * t_scale
+                edge_i_new$time_weighted <- edge_i_new$time * t_wt
+
+                edge_i_new$edge_id <- vapply (
+                    seq_len (nrow (edge_i_new)),
+                    function (i) genhash (10),
+                    character (1L)
+                )
+
+                edge_i <- rbind (edge_i, edge_i_new)
+            }
 
             return (edge_i)
         })
diff --git a/codemeta.json b/codemeta.json
index cdec181e..6fbefcd4 100644
--- a/codemeta.json
+++ b/codemeta.json
@@ -7,7 +7,7 @@
   "codeRepository": "https://github.com/ATFutures/dodgr",
   "issueTracker": "https://github.com/ATFutures/dodgr/issues",
   "license": "https://spdx.org/licenses/GPL-3.0",
-  "version": "0.2.20.026",
+  "version": "0.2.20.027",
   "programmingLanguage": {
     "@type": "ComputerLanguage",
     "name": "R",
diff --git a/man/add_nodes_to_graph.Rd b/man/add_nodes_to_graph.Rd
index 5b93cb1f..6636177d 100644
--- a/man/add_nodes_to_graph.Rd
+++ b/man/add_nodes_to_graph.Rd
@@ -5,7 +5,7 @@
 \title{Insert new nodes into a graph, breaking edges at point of nearest
 intersection.}
 \usage{
-add_nodes_to_graph(graph, xy, dist_tol = 0.000001)
+add_nodes_to_graph(graph, xy, dist_tol = 0.000001, intersections_only = FALSE)
 }
 \arguments{
 \item{graph}{A \code{dodgr} graph with spatial coordinates, such as a
@@ -16,6 +16,8 @@ matrix or \pkg{sf}-formatted \code{data.frame}.}
 
 \item{dist_tol}{Only insert new nodes if they are further from existing nodes
 than this distance, expressed in units of the distance column of \code{graph}.}
+
+\item{intersections_only}{If \code{FALSE}}
 }
 \value{
 A modified version of \code{graph}, with additional edges formed by
@@ -23,10 +25,22 @@ breaking previous edges at nearest perpendicular intersections with the
 points, \code{xy}.
 }
 \description{
-The "id" value of each edge to be divided through insertion of new points is
-modified to produce two new "id" values with suffixes "_A" and "_B". This
-routine presumes graphs to be \code{dodgr_streetnet} object, with geographical
-coordinates.
+Note that this routine presumes graphs to be \code{dodgr_streetnet} object, with
+geographical coordinates.
+}
+\details{
+This inserts new nodes by extending lines from each input point to the edge
+with the closest point of perpendicular intersection. That edge is then split
+at that point of intersection, creating two new edges (or four for directed
+edges). If \code{intersections_only = FALSE} (default), then additional edges are
+inserted from those intersection points to the input points. If
+\code{intersections_only = TRUE}, then nodes are added by splitting graph edges at
+points of nearest perpendicular intersection, without adding additional edges
+out to the actual input points.
+
+In the former case, the properties of those new edges, such as distance and
+time weightings, are inherited from the edges which are intersected, and may
+need to be manually modified after calling this function.
 }
 \examples{
 graph <- weight_streetnet (hampi, wt_profile = "foot")