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
UnverifiedDouglas-Peucker算法通过迭代去除偏离度小于阈值的中间点来简化折线，时间复杂度为O(n log n)73% similarUnverified四叉树空间索引可使碰撞检测的时间复杂度从O(n²)降低至O(n log n)量级73% similarVerifiedHNSW通过构建多层图索引将搜索复杂度降至近似O(log n)，IVF通过K-means聚类分割向量空间以牺牲约5-10%召回率换取数量级速度提升72% similarUnverifiedEKF-SLAM的计算复杂度为O(n²)，因为协方差矩阵维度随地标数量线性增长67% 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)