diff options
author | Campbell Barton <ideasman42@gmail.com> | 2014-06-11 04:17:22 +0400 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2014-06-14 02:27:19 +0400 |
commit | 746f0ad257b81e2680db10d9993c9054f059033c (patch) | |
tree | 0949fbb5dfad4a568a78bce8ac28fd7e73e01a39 /intern/guardedalloc | |
parent | 19b1da2b7b73c227807e4fc343efd88914a624cf (diff) |
Polyfill2d: use kd-tree
Simple search for intersections became slow for larger concave ngons (100+)
Tested to work with ngons up to 75k sides, performance is approx ~6x faster then scanfill.
This is a 2D version of BLI_kdtree with modifications:
- nodes can be removed
- an index -> node map is stored (especially for tessellation)
Diffstat (limited to 'intern/guardedalloc')
0 files changed, 0 insertions, 0 deletions