Blender Git Commits

Blender Git "bmesh-boolean-experiment" branch commits.

Page: 2 / 4

December 10, 2015, 01:02 (GMT)
Merge branch 'master' into bmesh-boolean-experiment
December 9, 2015, 10:11 (GMT)
Initial (stupid) edge intersection checking

This will need to be optimized, (every link checks all other edges),
just commit this as a first step.
December 9, 2015, 07:56 (GMT)
Merge branch 'master' into bmesh-boolean-experiment
December 9, 2015, 05:57 (GMT)
temporarily convert the geometry to 2d coords

I wanted to avoid this, but its becoming too impractical to perform 2d calculations on 3d geometry.
December 9, 2015, 05:38 (GMT)
Add BM_face_split_edgenet_connect_islands to bmesh_polygon_edgenet.c
December 9, 2015, 05:27 (GMT)
Merge branch 'master' into bmesh-boolean-experiment
December 9, 2015, 03:27 (GMT)
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.
December 9, 2015, 03:04 (GMT)
Merge branch 'master' into bmesh-boolean-experiment
December 8, 2015, 11:54 (GMT)
Merge branch 'master' into bmesh-boolean-experiment
December 8, 2015, 11:41 (GMT)
boolean-hole-filling: postpone sorting edges until we know they're holes

Instead of sorting all edges, just sort the groups.
December 8, 2015, 08:32 (GMT)
Cleanup: merge arrays into edge-group struct
December 8, 2015, 07:56 (GMT)
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.
December 7, 2015, 11:54 (GMT)
Improved starting point when calculating island joining paths
December 7, 2015, 08:19 (GMT)
Replace prepend -> append

This is needed to start with the outer-most file-boundary
December 7, 2015, 08:14 (GMT)
Merge branch 'master' into bmesh-boolean-experiment
December 7, 2015, 07:48 (GMT)
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.
December 6, 2015, 11:27 (GMT)
Merge branch 'master' into bmesh-boolean-experiment
December 6, 2015, 00:43 (GMT)
Merge branch 'master' into bmesh-boolean-experiment
December 5, 2015, 13:06 (GMT)
avoid bow-tie when detecting parallel vert-pair
December 5, 2015, 12:07 (GMT)
Initial support for holes w/ bmesh booleans
By: Miika HämäläinenLast update: Nov-07-2014 14:18 MiikaHweb | 2003-2020