forked from bartvdbraak/blender
746f0ad257
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) |
||
---|---|---|
build_files | ||
doc | ||
extern | ||
intern | ||
release | ||
scons@2d6ebcb239 | ||
source | ||
.arcconfig | ||
.gitignore | ||
.gitmodules | ||
CMakeLists.txt | ||
COPYING | ||
GNUmakefile | ||
SConstruct |