s2_contains(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
c("POINT (5 5)", "POINT (-1 1)")
)
#> [1] TRUE FALSE
s2_within(
c("POINT (5 5)", "POINT (-1 1)"),
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))"
)
#> [1] TRUE FALSE
s2_covered_by(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
c("POINT (5 5)", "POINT (-1 1)")
)
#> [1] FALSE FALSE
s2_covers(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
c("POINT (5 5)", "POINT (-1 1)")
)
#> [1] TRUE FALSE
s2_disjoint(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
c("POINT (5 5)", "POINT (-1 1)")
)
#> [1] FALSE TRUE
s2_intersects(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
c("POINT (5 5)", "POINT (-1 1)")
)
#> [1] TRUE FALSE
s2_equals(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
c(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
"POLYGON ((10 0, 10 10, 0 10, 0 0, 10 0))",
"POLYGON ((-1 -1, 10 0, 10 10, 0 10, -1 -1))"
)
)
#> [1] TRUE TRUE FALSE
s2_intersects(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
c("POINT (5 5)", "POINT (-1 1)")
)
#> [1] TRUE FALSE
s2_intersects_box(
c("POINT (5 5)", "POINT (-1 1)"),
0, 0, 10, 10
)
#> [1] TRUE FALSE
s2_touches(
"POLYGON ((0 0, 0 1, 1 1, 0 0))",
c("POINT (0 0)", "POINT (0.5 0.75)", "POINT (0 0.5)")
)
#> [1] TRUE FALSE FALSE
s2_dwithin(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
c("POINT (5 5)", "POINT (-1 1)"),
0 # distance in meters
)
#> [1] TRUE FALSE
s2_dwithin(
"POLYGON ((0 0, 10 0, 10 10, 0 10, 0 0))",
c("POINT (5 5)", "POINT (-1 1)"),
1e6 # distance in meters
)
#> [1] TRUE TRUE
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4