Distinct distances in R3 between quadratic and orthogonal curves

European Journal of Combinatorics(2024)

引用 0|浏览0
暂无评分
摘要
We study the minimum number of distinct distances between point sets on two curves in R3. Assume that one curve contains m points and the other n points. Our main results:(a) When the curves are conic sections, we characterize all cases where the number of distances is O(m+n). This includes new constructions for points on two parabolas, two ellipses, and one ellipse and one hyperbola. In all other cases, the number of distances is Ω(min{m2/3n2/3,m2,n2}).(b) When the curves are not necessarily algebraic but smooth and contained in perpendicular planes, we characterize all cases where the number of distances is O(m+n). This includes a surprising new construction of non-algebraic curves that involve logarithms. In all other cases, the number of distances is Ω(min{m2/3n2/3,m2,n2}).
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要