Unverified50% confidenceFactExact time
Barnes-Hut 优化通过空间八叉树将远距离节点群近似为单一质心，将计算复杂度从 O(N²) 降低到 O(N log N)
1
Sources
50%
Confidence
Long-term
Relevance
8/23/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Douglas-Peucker algorithm simplifies polylines by iteratively removing intermediate points whose deviation is below a threshold, with a time complexity of O(n log n).73% similarUnverified四叉树空间索引可使碰撞检测的时间复杂度从O(n²)降低至O(n log n)量级73% similarVerifiedHNSW reduces search complexity to approximately O(log n) by constructing a multi-layer graph index, while IVF partitions the vector space via K-means clustering to achieve orders-of-magnitude speed improvements at the cost of approximately 5–10% recall.72% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks67% similarUnverifiedGated Delta Net将状态空间复杂度从标准注意力的O(N²)降到O(N)量级67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/791534API
curl https://kongchang.com/api/v1/knowledge/claims/791534MCP
get_claim(id=791534)