Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2016-03-19mathutils.bvhtree: Add find_nearest_range API callCampbell Barton
Returns all elements within a radius. Similar to kdtree.find_range
2016-02-12Fix crash in bvhtree.FromPolygonsCampbell Barton
2016-02-08Fix T47337: BVHTree.find_nearest missingCampbell Barton
Method wasn't named as documented.
2016-01-14Cleanup: use BM_mesh_* prefix for BMesh functionsCampbell Barton
2015-12-02Using term 'origin' for mathutils.bvhtree docsCampbell Barton
Matches rna ray-cast API
2015-10-18Fix T46520: mathutils.bvhtree crashes with distance input.Bastien Montagne
Should be backported to 'a' release.
2015-09-04Quiet warningsJulian 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-24mathutils.BVHTree: support overlap self-intersectCampbell Barton
Use same logic as BKE_bmbvh_overlap
2015-08-24BVHTree.FromBMesh() missed epsilon argCampbell Barton
2015-08-22Cleanup: spellingCampbell Barton
2015-08-20Resolve MSVC/OpenMP compat issueCampbell Barton
2015-08-20BVH-overlap: add callback to BLI_bvhtree_overlapCampbell 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-03Add bool parser for PyArg_ParseTupleCampbell Barton
Use for mathutils.bvhtree
2015-07-29Add mathutils.bvhtree APICampbell 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