Unverified50% confidenceFactExact time
GJK determines intersection by iteratively computing the Minkowski difference of two convex shapes, with the cost of each iteration positively correlated with the number of vertices in the shapes.
1
Sources
50%
Confidence
Long-term
Relevance
9/30/2026
First Seen
Sources
Related Entities
Related Claims
Unverified在几何凹凸性判断中，NumPy常用于计算相邻边向量的叉积，若叉积符号在多边形顶点间发生变化则对应顶点为凹点64% similarUnverified在火腿三明治定理的二维证明中，函数满足反足条件g(-v)=-g(v)，使Borsuk-Ulam定理保证存在方向使两个形状被同时平分63% similarUnverifiedThe Crouzeix conjecture states: for any complex matrix A and any complex analytic function f on its numerical range, ‖f(A)‖ ≤ 2·sup{|f(z)| : z ∈ W(A)}, with the conjecture that the constant 2 is sharp.60% similarUnverifiedBy inscribing a unit circle of radius 1 inside a square with side length 2, the probability of a randomly scattered point falling inside the circle equals the circle's area divided by the square's area, i.e., π/4, so multiplying the proportion of points inside the circle by 4 estimates π.60% similarUnverified难抵极点从数学本质上等价于求解区域内切圆的圆心，在计算几何中被称为Chebyshev中心问题59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/963139API
curl https://kongchang.com/api/v1/knowledge/claims/963139MCP
get_claim(id=963139)