Unverified50% confidenceFactExact time
The computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks
1
Sources
50%
Confidence
Long-term
Relevance
8/9/2026
First Seen
Sources
视觉SLAM学习路线图全解析：从数学基础到工程实践
Related Claims
UnverifiedEarly SLAM methods were dominated by the Extended Kalman Filter (EKF-SLAM), whose computational complexity grows quadratically with the number of landmarks.72% similarUnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.70% similarUnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).68% similarUnverifiedThe 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).68% similarUnverified圈复杂度衡量代码中独立执行路径的数量，与缺陷密度存在显著正相关67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/714747API
curl https://kongchang.com/api/v1/knowledge/claims/714747MCP
get_claim(id=714747)