#1305 dms_split_convex_polygon_keilsnoeyink and dms_convex_polygon_connectivity, and the grouped forms of dms_polygon_connectivity Two new pages, since 20.24.0: - dms_split_convex_polygon_keilsnoeyink: the minimum number of strictly convex parts for a polygon without holes, what falls back to Hertel and Mehlhorn, the measured counts and times, and when it does not pay: in the connectivity of grown parts the split cost more than the fewer parts saved. - dms_convex_polygon_connectivity: the four forms of dms_polygon_connectivity with convex polygons as premise, the exact test per pair, the slivers it finds that the sweep rounds away, and how much it saves (5 to 20%, since finding the candidates takes most of the time). dms_polygon_connectivity: the forms with a group per polygon, no pair within a group and one pair per pair of groups, the direction of a pair of groups with one and with two sets, and the measured advice to grow the polygons themselves when only their pairs are needed. dms_split_convex_polygon, dms polygon operators and polygon operators: the new operators listed and linked; the testcase description covers both split operators. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>