Dylan M. Taylor b7dee07cf4 Path booleans: sparse winding numbers and bounded merge runs (#2946) ...

Winding numbers were dense vectors up to each segment's path index, and the
topology keeps one per segment, so memory grew with the square of the path
count. They now store only the nonzero (path, winding) pairs.

tidy_segments re-checked the whole run on every merge attempt, so a long
chain of collinear pieces cost quadratic time. A run now merges at most 64
pieces; longer runs leave a few extra joints on the same line or curve.

2026-11-03 09:57:48 -05:00

..

src

Path booleans: sparse winding numbers and bounded merge runs (#2946)

2026-11-03 09:57:48 -05:00

Cargo.toml

chore(deps): refresh safe dependency bumps

2026-10-25 16:36:21 -06:00