Age | Commit message (Collapse) | Author | |
---|---|---|---|
2016-03-19 | mathutils.bvhtree: Add find_nearest_range API call | Campbell Barton | |
Returns all elements within a radius. Similar to kdtree.find_range | |||
2016-02-12 | Fix crash in bvhtree.FromPolygons | Campbell Barton | |
2016-02-08 | Fix T47337: BVHTree.find_nearest missing | Campbell Barton | |
Method wasn't named as documented. | |||
2016-01-14 | Cleanup: use BM_mesh_* prefix for BMesh functions | Campbell Barton | |
2015-12-02 | Using term 'origin' for mathutils.bvhtree docs | Campbell Barton | |
Matches rna ray-cast API | |||
2015-10-18 | Fix T46520: mathutils.bvhtree crashes with distance input. | Bastien Montagne | |
Should be backported to 'a' release. | |||
2015-09-04 | Quiet warnings | Julian Eisel | |
We had too many warnings lately... was awaiting that someone would kill them - didn't happen -> goes to my commit ratio! :P | |||
2015-08-24 | mathutils.BVHTree: support overlap self-intersect | Campbell Barton | |
Use same logic as BKE_bmbvh_overlap | |||
2015-08-24 | BVHTree.FromBMesh() missed epsilon arg | Campbell Barton | |
2015-08-22 | Cleanup: spelling | Campbell Barton | |
2015-08-20 | Resolve MSVC/OpenMP compat issue | Campbell Barton | |
2015-08-20 | BVH-overlap: add callback to BLI_bvhtree_overlap | Campbell Barton | |
The callback checks if 2 nodes intersect (not just their AABB). Advantages: - theres no need to allocate overlaps which are later ignored. - expensive intersection tests will run multi-threaded. Currently only used for Python API. | |||
2015-08-03 | Add bool parser for PyArg_ParseTuple | Campbell Barton | |
Use for mathutils.bvhtree | |||
2015-07-29 | Add mathutils.bvhtree API | Campbell Barton | |
Originally D966 by @lukastoenne, with own additions - trees can be initialized from Object's, BMesh, or passed in as vert+polygon arrays. - original indices of ngons/faces are used. (instead of tessellated indices). - ray_cast, find_nearest methods - find overlapping faces between 2 trees |