Eight-partitioning points in 3D, and efficiently too
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.
Download
Conference Paper
| Published
| English
Scopus indexed
Author
Corresponding author has ISTA affiliation
Department
Abstract
An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in ℝ³ consists of three planes that divide the space into 8 octants, such that each open octant contains at most 1/8 of the points (respectively, of the mass). In 1966, Hadwiger showed that any mass distribution in ℝ³ admits an eight-partition; moreover, one can prescribe the normal direction of one of the three planes. The analogous result for finite point sets follows by a standard limit argument.
We prove the following variant of this result: Any mass distribution (or point set) in ℝ³ admits an eight-partition for which the intersection of two of the planes is a line with a prescribed direction.
Moreover, we present an efficient algorithm for calculating an eight-partition of a set of n points in ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2}).
Publishing Year
Date Published
2024-06-06
Proceedings Title
40th International Symposium on Computational Geometry
Publisher
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Acknowledgement
Aronov, Boris: Work has been supported by NSF grants CCF 15-40656 and CCF 20-08551, and by grant 2014/170 from the US-Israel Binational Science Foundation. Part of this research was conducted while BA was visiting ISTA in the summers of 2022 and 2023. The visit of BA to ISTA in the summer of 2022 was supported by an ISTA Visiting Professorship.
Basit, Abdul: Work has been supported by Australian Research Council grant DP220102212.
Ramesh, Indu: Work supported by a Tandon School of Engineering Fellowship and by NSF Grant CCF-20-08551.
BA and AB would like to thank William Steiger for insightful initial discussions of the problems addressed in this work.
Volume
293
Page
8:1-8:15
Conference
SoCG: Symposium on Computational Geometry
Conference Location
Athens, Greece
Conference Date
2024-06-11 – 2024-06-14
ISBN
IST-REx-ID
Cite this
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15. doi:10.4230/LIPIcs.SoCG.2024.8
Aronov, B., Basit, A., Ramesh, I., Tasinato, G., & Wagner, U. (2024). Eight-partitioning points in 3D, and efficiently too. In 40th International Symposium on Computational Geometry (Vol. 293, p. 8:1-8:15). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.8
Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” In 40th International Symposium on Computational Geometry, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.8.
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.
Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” 40th International Symposium on Computational Geometry, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:10.4230/LIPIcs.SoCG.2024.8.
All files available under the following license(s):
Creative Commons Attribution 4.0 International Public License (CC-BY 4.0):
Main File(s)
File Name
2024_LIPICs_Aronov.pdf
880.73 KB
Access Level

Date Uploaded
2025-01-27
MD5 Checksum
443aa29ea5d948e917cfccd681dcf176
Export
Marked PublicationsOpen Data ISTA Research Explorer
Sources
arXiv 2403.02627