k-非退化集的关联及其应用

A. Basit, Adam Sheffer
{"title":"k-非退化集的关联及其应用","authors":"A. Basit, Adam Sheffer","doi":"10.20382/jocg.v5i1a14","DOIUrl":null,"url":null,"abstract":"We study point-sphere and point-plane incidences in the three-dimensional space. In particular, for $1 0$, the number of incidences between a set of $m$ points and a $k$-non-degenerate set of $n$ spheres is \\[ O(m^{3/4+\\varepsilon}n^{3/4}k^{1/4}+n+mk).\\] Similarly, we prove that, for every $\\varepsilon>0$, the number of incidences between a set of $m$ points and a $k$-non-degenerate set of $n$ planes is \\[ O(m^{4/5+\\varepsilon}n^{3/5}k^{2/5} + n + mk). \\] These bounds are obtained by using the polynomial partitioning technique, recently introduced by Guth and Katz. More specifically, in our proofs we use a pair of constant-degree partitioning polynomials. We also present a couple of applications of $k$-non-degenerate sets: (i) We consider an extension of the three-dimensional unit distances problem, in which we are given a set $D$ of $k$ distinct distances and ask for a three-dimensional set of $m$ points that maximizes the number of pairs of points that span a distance from $D$. By relying on $k$-non-degenerate sets of spheres, we prove an upper bound of $O(m^{236/149+\\varepsilon}k^{125/149})$ for the problem (which improves the trivial bound for large values of $k$).      (ii) We consider the maximum number of incidences between a three-dimensional set of $n$ planes (without any restrictions) and a set of $m$ points, such that no $k$ points are collinear. Our bound for $k$-non-degenerate planes immediately implies a bound of $O(n^{4/5+\\varepsilon}m^{3/5}k^{2/5} + m + nk)$ for this problem, generalizing the previous bound $O(n^{4/5}m^{3/5} + n\\log m)$ for the specific case where no three points are collinear (up to the $\\varepsilon$ in the exponent).","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"42 1","pages":"284-302"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Incidences with k-non-degenerate sets and their applications\",\"authors\":\"A. Basit, Adam Sheffer\",\"doi\":\"10.20382/jocg.v5i1a14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study point-sphere and point-plane incidences in the three-dimensional space. In particular, for $1 0$, the number of incidences between a set of $m$ points and a $k$-non-degenerate set of $n$ spheres is \\\\[ O(m^{3/4+\\\\varepsilon}n^{3/4}k^{1/4}+n+mk).\\\\] Similarly, we prove that, for every $\\\\varepsilon>0$, the number of incidences between a set of $m$ points and a $k$-non-degenerate set of $n$ planes is \\\\[ O(m^{4/5+\\\\varepsilon}n^{3/5}k^{2/5} + n + mk). \\\\] These bounds are obtained by using the polynomial partitioning technique, recently introduced by Guth and Katz. More specifically, in our proofs we use a pair of constant-degree partitioning polynomials. We also present a couple of applications of $k$-non-degenerate sets: (i) We consider an extension of the three-dimensional unit distances problem, in which we are given a set $D$ of $k$ distinct distances and ask for a three-dimensional set of $m$ points that maximizes the number of pairs of points that span a distance from $D$. By relying on $k$-non-degenerate sets of spheres, we prove an upper bound of $O(m^{236/149+\\\\varepsilon}k^{125/149})$ for the problem (which improves the trivial bound for large values of $k$).      (ii) We consider the maximum number of incidences between a three-dimensional set of $n$ planes (without any restrictions) and a set of $m$ points, such that no $k$ points are collinear. Our bound for $k$-non-degenerate planes immediately implies a bound of $O(n^{4/5+\\\\varepsilon}m^{3/5}k^{2/5} + m + nk)$ for this problem, generalizing the previous bound $O(n^{4/5}m^{3/5} + n\\\\log m)$ for the specific case where no three points are collinear (up to the $\\\\varepsilon$ in the exponent).\",\"PeriodicalId\":54969,\"journal\":{\"name\":\"International Journal of Computational Geometry & Applications\",\"volume\":\"42 1\",\"pages\":\"284-302\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20382/jocg.v5i1a14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20382/jocg.v5i1a14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 8

摘要

我们研究了三维空间中点球和点平面的入射。特别是,对于 $1 0$,一组之间的事件数 $m$ 分和a $k$的非简并集 $n$ Spheres是 \[ O(m^{3/4+\varepsilon}n^{3/4}k^{1/4}+n+mk).\] 同样地,我们证明,对于每一个 $\varepsilon>0$,一组之间的事件数 $m$ 分和a $k$的非简并集 $n$ 飞机是 \[ O(m^{4/5+\varepsilon}n^{3/5}k^{2/5} + n + mk). \] 这些边界是用最近由Guth和Katz引入的多项式分划技术得到的。更具体地说,在我们的证明中,我们使用了一对常次分区多项式。的几个应用 $k$-非退化集:(i)我们考虑三维单位距离问题的扩展,其中我们给定一个集合 $D$ 的 $k$ 不同的距离,要求一个三维的集合 $m$ 使点对数目最大化的点,这些点对跨越一段距离 $D$. 依靠 $k$-非简并球集,证明了的上界 $O(m^{236/149+\varepsilon}k^{125/149})$ 对于这个问题(它改进了大值的平凡界 $k$). Â Â Â (ii)我们考虑三维集合之间的最大事件数 $n$ 飞机(没有任何限制)和一套 $m$ 分,这样就没有了 $k$ 点共线。我们的目的地是 $k$-非简并平面立即意味着的界 $O(n^{4/5+\varepsilon}m^{3/5}k^{2/5} + m + nk)$ 对于这个问题,推广上界 $O(n^{4/5}m^{3/5} + n\log m)$ 对于没有三个点共线的特殊情况(直到 $\varepsilon$ 在指数中)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Incidences with k-non-degenerate sets and their applications
We study point-sphere and point-plane incidences in the three-dimensional space. In particular, for $1 0$, the number of incidences between a set of $m$ points and a $k$-non-degenerate set of $n$ spheres is \[ O(m^{3/4+\varepsilon}n^{3/4}k^{1/4}+n+mk).\] Similarly, we prove that, for every $\varepsilon>0$, the number of incidences between a set of $m$ points and a $k$-non-degenerate set of $n$ planes is \[ O(m^{4/5+\varepsilon}n^{3/5}k^{2/5} + n + mk). \] These bounds are obtained by using the polynomial partitioning technique, recently introduced by Guth and Katz. More specifically, in our proofs we use a pair of constant-degree partitioning polynomials. We also present a couple of applications of $k$-non-degenerate sets: (i) We consider an extension of the three-dimensional unit distances problem, in which we are given a set $D$ of $k$ distinct distances and ask for a three-dimensional set of $m$ points that maximizes the number of pairs of points that span a distance from $D$. By relying on $k$-non-degenerate sets of spheres, we prove an upper bound of $O(m^{236/149+\varepsilon}k^{125/149})$ for the problem (which improves the trivial bound for large values of $k$).      (ii) We consider the maximum number of incidences between a three-dimensional set of $n$ planes (without any restrictions) and a set of $m$ points, such that no $k$ points are collinear. Our bound for $k$-non-degenerate planes immediately implies a bound of $O(n^{4/5+\varepsilon}m^{3/5}k^{2/5} + m + nk)$ for this problem, generalizing the previous bound $O(n^{4/5}m^{3/5} + n\log m)$ for the specific case where no three points are collinear (up to the $\varepsilon$ in the exponent).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.80
自引率
0.00%
发文量
4
审稿时长
>12 weeks
期刊介绍: The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms. Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others. Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome. Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.
期刊最新文献
On morphs of 1-plane graphs A Geometric Approach to Inelastic Collapse Near-optimal algorithms for point-line fitting problems Algorithms for approximate sparse regression and nearest induced hulls Recognizing weighted and seeded disk graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1