Faster overlap checks? #1
Description
Verify if we can use faster overlap checks as described in
// Simple data structure to represent circle sectors
// Angles are measured in [0,65535] instead of [0,359], in such a way that modulo operations are much faster (since 2^16 = 65536)
// Credit to Fabian Giesen at "https://web.archive.org/web/20200912191950/https://fgiesen.wordpress.com/2015/09/24/intervals-in-modular-arithmetic/" for useful implementation tips regarding interval overlaps in modular arithmetics
from https://github.com/vidalt/HGS-CVRP/blob/main/Program/CircleSector.h.