Automatically repair planar partitions using a constrained triangulation approach.
st_pprepair( x, method = c("RN", "LB"), valid_each = FALSE, also_universe = TRUE, remove_vertices = FALSE, split_regions = -1, priority_list = "", quiet = TRUE, ... )
x | object of class |
---|---|
method | character; pick which method to use. One of fix, RN, LB, PL or EM. |
valid_each | logical; skip the individual validation of each polygon, default to FALSE |
also_universe | logical; if TRUE allow removing invalid regions (where convenient) |
remove_vertices | logical; Removes unnecessary vertices before reconstruction to support larger data sets (try if you get a segmentation fault) |
split_regions | numeric; maximum distance for inserting new constraints when splitting |
priority_list | character; path to text file with priority list for repairing for methods PL and EM |
quiet | logical; if TRUE the output are less verbose |
... | extra parameters for other algorithms |