{"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}
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).
期刊介绍:
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.