| Work | Type of Set | Signed | Detect Collision | Time Complexity |
| Liu et al. (2021) [ 14 ] | A point and a possibly nonconvex set in R3 , represented as a point cloud | Yes | No | O(K) per query for the full formula, in which K is the number of points. Local evaluation uses k=10 nearby points, plus neighbor-search cost |
| Hicken et al. (2022) [ 15 ] | A point and a possibly nonconvex set in R2 or R3 , represented as a point cloud | Yes | No | O(K) per query for the full formula, in which K is the number of points. The implementation uses k=10 nearest points, plus neighbor-search cost |
| Gonçalves et al. (2024) [ 8 ] | Two convex sets in Rn . Only give practical approximate formulae for balls, boxes and cylinders. | No | No, with arbitrarily small error as h→+0 | Iterative, no fixed number of steps |
| Beker et al. (2025) [ 16 ] | Almost arbitrary sets in Rn , represented as point clouds | Yes | No, with arbitrarily small error as h→+0 | O(KAKB) , where KA and KB are the numbers of points in the respective objects |
| Wu et al. (2025) [ 6 ] | Two convex polyhedral sets in R2 | Yes | No; conservative for finite smoothing, with arbitrarily small error as h→+0 | O(VAVB) , where VA and VB are the numbers of vertices |
| Gonçalves et al. (2026) [ 9 ] | Two convex sets in Rn . Only gives practical formulae for polyhedra. | No | Yes | Iterative, no fixed number of steps. If the two objects are polyhedral and have FA,FB faces, respectively, each step is O(FA+FB) |