Unverified50% confidenceFactExact time
Brass, Moser, and Pach described the unit distance problem in 'Research Problems in Discrete Geometry' as perhaps 'the most well-known and easily stated problem in combinatorial geometry.'
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
7/2/2026
First Seen
Valid until: 9/30/2026
Sources
Related Claims
Unverified几何内核最棘手的问题是数值鲁棒性，浮点误差在布尔运算中可能产生退化边或非流形拓扑70% similarUnverified平面单位距离问题与Erdős-Szemerédi猜想、Erdős距离问题并列为组合几何三大经典难题61% similarUnverified难抵极点从数学本质上等价于求解区域内切圆的圆心，在计算几何中被称为Chebyshev中心问题61% similarUnverified球面亏格为0，环面亏格为1，亏格是衡量曲面复杂程度的拓扑不变量54% similarUnverified雅可比矩阵描述关节空间速度到笛卡尔空间速度的映射，末端位置误差δx = J·δθ54% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/50587API
curl https://kongchang.com/api/v1/knowledge/claims/50587MCP
get_claim(id=50587)