Unverified50% confidenceFactExact time
Douglas-Peucker 线简化算法通过递归寻找距离线段最远的点逐步剔除中间点，可将渲染点数降低 90% 以上
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).70% similarUnverifiedTool-call optimization has reduced the "nudging" problem by 50% to 90% without sacrificing accuracy.62% similarUnverifiedIVF算法通过K-means聚类将向量空间分区，检索时只扫描最近的若干分区，以牺牲少量精度换取更低的内存占用61% similarUnverifiedFor small targets, large images should be tiled into overlapping 1008 px patches for separate inference and then merged; never resize directly, as this will produce confident but blurry boundaries or destroy small targets.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/790056API
curl https://kongchang.com/api/v1/knowledge/claims/790056MCP
get_claim(id=790056)