Blender Git Commits

Merge branch 'master' into bmesh-boolean-experiment

Initial (stupid) edge intersection checking

This will need to be optimized, (every link checks all other edges),
just commit this as a first step.

Merge branch 'master' into bmesh-boolean-experiment

temporarily convert the geometry to 2d coords

I wanted to avoid this, but its becoming too impractical to perform 2d calculations on 3d geometry.

Add BM_face_split_edgenet_connect_islands to bmesh_polygon_edgenet.c

Merge branch 'master' into bmesh-boolean-experiment

Improve hole-detection

- use vert-stack instead of edges for walking edge-links (avoid a nested loop).
- count verts as well as edges when walking over edge-links.
- don't over-alloc vert arrays (was using total edges * 2)
- use the simpler linklist prepend since order if edges is no longer relied on.
- order edges/group walking for minimal sorting.
- use the dominant axis to order verts instead of abusing the vertex normal.

Merge branch 'master' into bmesh-boolean-experiment

Merge branch 'master' into bmesh-boolean-experiment

boolean-hole-filling: postpone sorting edges until we know they're holes

Instead of sorting all edges, just sort the groups.

Cleanup: merge arrays into edge-group struct

Use a different method of calculating path for face-holes

Instead of finding close points between islands.

use first/last points on each island to find closest islands in negative/positive directions
when searching the KD-tree.

Improved starting point when calculating island joining paths

Replace prepend -> append

This is needed to start with the outer-most file-boundary

Merge branch 'master' into bmesh-boolean-experiment

Use kdtree filter callback to avoid having a separate tree for every hole

This way we can search all other face-hole verts excluding the current hole.

Merge branch 'master' into bmesh-boolean-experiment

Merge branch 'master' into bmesh-boolean-experiment

avoid bow-tie when detecting parallel vert-pair

Initial support for holes w/ bmesh booleans