Unverified50% confidenceFactExact time
The 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).
1
Sources
50%
Confidence
Long-term
Relevance
8/14/2026
First Seen
Sources
Related Claims
UnverifiedShor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)74% similarUnverified四叉树空间索引可使碰撞检测的时间复杂度从O(n²)降低至O(n log n)量级72% similarUnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).71% similarUnverified使用 Levenshtein 自动机判断候选词是否接受的时间复杂度仅与候选词长度线性相关（O(n)），无需重新计算编辑距离矩阵69% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/748143API
curl https://kongchang.com/api/v1/knowledge/claims/748143MCP
get_claim(id=748143)