Description Usage Arguments Value Examples
View source: R/SimplifyLinearNetwork.R
This algorithm attempts to automatically reduce a linear network's complexity without altering its basic geometric configuration. The main objective of the algorithm is to merge the pairs of edges of the network that are connected by a second-degree vertex (with only two incident edges) into only one edge. Equivalently, this action means to join two vertex of the network whose path of connection only passes through another vertex of the network.
1 | SimplifyLinearNetwork(network, Angle = NULL, Length = NULL, M = NULL)
|
network |
- A |
Angle |
- An angle (in degrees, from 0 to 90) to adjust the level of simplification performed by the algorithm |
Length |
- A length (in meters) to adjust the level of simplification performed by the algorithm |
M |
- A k x 2 |
Returns a simplification of the linear network passed as an input (linnet class)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | library(SpNetPrep)
library(spatstat.core)
library(spatstat.geom)
library(spatstat.linnet)
library(sp)
library(raster)
library(maptools)
network <- chicago$domain
Angle <- 10
Length <- 20
simplified_network_1 <- SimplifyLinearNetwork(network,Angle=Angle,Length=Length)
## Not run:
M <- matrix(c(10,60,40,25),nrow=2)
simplified_network_2 <- SimplifyLinearNetwork(network,M=M)
## End(Not run)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.