View source: R/intersections.R
layer_n | R Documentation |
Find all fragments that are intersected by any other feature in any layer.
layer_n(x, n = 2, ..., keep_index = FALSE)
x |
polymer |
n |
minimum number of intersections to keep |
... |
ignored for now |
keep_index |
for expert use only, maintains the list of triangle indexes on the sf output (and sf cannot plot if that is present) |
Returns a simple features data frame with all triangles that occur n
times with
n = 2
as a minimum. Each triangle feature contains a nested data frame in idx
that keeps the links to the input layers by layer
, object
and path
.
sf data frame
library(sf)
plot(A["layer"], reset = TRUE)
plot(B, add = TRUE, col = "hotpink")
plot(C, add = TRUE, col = "firebrick")
sb <- polymer(A, B, C)
plot(layer_n(sb), add = TRUE, col = "grey")
plot(layer_n(sb, n = 3), add = TRUE, col = "dodgerblue")
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.