As proposed by Zunic and Rosin (see below). May need some testing/review.
Source
Zunic J, Rosin PL. 2003. Rectilinearity measurements for polygons. IEEE Transactions on Pattern Analysis and Machine Intelligence 25: 1193-1200.
Note
due to the laborious nature of the algorithm (in nb.pts^2), and of its implementation, it may be very long to compute.
See also
Other coo_ descriptors:
coo_angle_edges()
,
coo_angle_tangent()
,
coo_area()
,
coo_boundingbox()
,
coo_chull()
,
coo_circularity()
,
coo_convexity()
,
coo_eccentricity
,
coo_elongation()
,
coo_length()
,
coo_lw()
,
coo_rectangularity()
,
coo_scalars()
,
coo_solidity()
,
coo_tac()
,
coo_width()
Examples
bot[1] %>%
coo_sample(32) %>% # for speed sake only
coo_rectilinearity
#> [1] 0.3539899
bot %>%
slice(1:3) %>% coo_sample(32) %>% # for speed sake only
coo_rectilinearity
#> $brahma
#> [1] 0.3539899
#>
#> $caney
#> [1] 0.3751378
#>
#> $chimay
#> [1] 0.3597856
#>