Ellen Emilia Anna Zscheile 7799c50829 feat(math): implement search for boundaries of partitions in cyclic partitioned lists. ... e.g. find the bounds of false, true in [false, true, true, false, false] under the condition that the blocks in partitions of a single value are connected, meaning when considering the list as cyclic, there are at most 2 blocks (for value true, false). This implements only the binary case. Exponential search was suggested by Harold Aptroot <@harold@mastodon.gamedev.place> Example/motivating use case: detecting which parts of the exterior of a Polygon face towards a point, and which parts don't, in particular finding the (extremal) points contained in the tangents. This use case is implemented in `poly_ext_tangent_points`. Signed-off-by: Ellen Emilia Anna Zscheile <fogti+devel@ytrizja.de>		2025-05-01 15:28:20 +02:00
..
cyclic_search.txt	feat(math): implement search for boundaries of partitions in cyclic partitioned lists.	2025-05-01 15:28:20 +02:00