Huom: Git tilastot ja lokit eivät enää päivity 2022-01-01 jälkeen. Voit käyttää muita sivuja Blender kehityksen seuraamiseen, kuten:
Blender Git "bmesh-boolean-experiment" branch commits.
Blender Git Loki
December 11, 2015, 8:25 (GMT) |
cleanup dna |
December 11, 2015, 8:10 (GMT) |
Merge branch 'master' into bmesh-boolean-experiment |
December 11, 2015, 6:29 (GMT) |
Add boolean as an edit-mode tool |
December 11, 2015, 5:43 (GMT) |
Minor changes needed for for accessing booleans in editmode - Replace hard coded edge-delimiter checks with a call that forwards face-side check to the callback passed to BM_mesh_intersect. - Copy the hflag exactly when splitting a by the edge-net. Also remove experimental bvh-overlap test. |
December 11, 2015, 5:20 (GMT) |
Merge branch 'master' into bmesh-boolean-experiment |
December 11, 2015, 2:46 (GMT) |
Merge branch 'master' into bmesh-boolean-experiment |
December 11, 2015, 0:28 (GMT) |
Merge branch 'master' into bmesh-boolean-experiment |
December 10, 2015, 15:28 (GMT) |
Change method of hit-counting Instead of de-duplicating on each ray-hit addition, sort and count non duplicates. |
December 10, 2015, 14:18 (GMT) |
Check when we can't find paths - was asserting For very scrambled degenerate geometry where this error is unavoidable. |
December 10, 2015, 13:46 (GMT) |
Merge branch 'master' into bmesh-boolean-experiment |
December 10, 2015, 12:44 (GMT) |
Merge branch 'master' into bmesh-boolean-experiment |
December 10, 2015, 10:21 (GMT) |
Merge branch 'master' into bmesh-boolean-experiment |
December 10, 2015, 10:13 (GMT) |
Merge branch 'master' into bmesh-boolean-experiment |
December 10, 2015, 10:4 (GMT) |
Don't tag in BM_face_split_edgenet_connect_islands This is only needed for intersect logic. |
December 10, 2015, 9:58 (GMT) |
Use memarena to avoid too many stack allocations |
December 10, 2015, 8:57 (GMT) |
Avoid using macro for main connect searching logic |
December 10, 2015, 8:41 (GMT) |
Use modified approach for selecting vertices to connect islands Cast 2d rays instead of using a kdtree. This is mostly finished now, just need to improve memory handling and minor cleanup. |
December 10, 2015, 4:46 (GMT) |
Check connecting edges against eachother This isn't using spacial optimizations since these are constantly being added and in most cases wont be very many. |
December 10, 2015, 4:8 (GMT) |
Use bvhtree for checking if connecting edges dont intersect |
December 10, 2015, 2:12 (GMT) |
minor cleanup/rename |