Displaying 2 results from an estimated 2 matches for "btconvexhull".
2014 Jan 28
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
Hi Stepan,
Sorry for the delay. It's great that you are working on MergeFunctions
as well and I agree, we should definitely try to combine our efforts to
improve MergeFunctions.
Just to give you some context, the pass (with the similar function
merging patch) is already being used in a production setting. From my
point of view, it would be better if we focus on improving its
capability
2014 Jan 30
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...vex2dAlgorithm.ll 63 147491 3 0.02 146901 0 0.02 147473
btConvex2dShape.ll 18 28398 0 0.01 28380 0 0.01 27468
btConvexCast.ll 2 4053 0 0.01 4035 0 0.01 4035
btConvexConcaveCollisionAlgorithm.ll 129 282142 2 0.03 280520 2 0.03 281500
btConvexConvexAlgorithm.ll 158 417362 16 0.04 414499 6 0.04 412425
btConvexHull.ll 174 518660 43 0.05 507907 * * *
btConvexHullShape.ll 58 99926 4 0.01 97541 3 0.02 97609
btConvexInternalShape.ll 52 116885 3 0.02 114685 3 0.02 113852
btConvexPlaneCollisionAlgorithm.ll 87 193900 8 0.02 193642 4 0.02 190537
btConvexPointCloudShape.ll 35 59583 3 0.02 57919 2 0.02 57970
btConvexSh...