mirror of
https://github.com/storytold/vectorcraft.git
synced 2026-11-10 14:41:19 +00:00
For every hole (when growing) or island (when insetting), the check measured the distance to every segment of the input with the nearest-point search and took the minimum, so the cost grew with holes x segments. Segment bounding boxes are now computed once, a segment whose box is farther than the offset distance is skipped, and the search stops at the first segment that is close enough. The decision is the same as before; a test compares it with the old full scan on random segment sets. Co-Authored-By: Claude Sonnet 5.5 <noreply@anthropic.com>