PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 4, 20240 citationsOpen Access

Eight-Partitioning Points in 3D, and Efficiently Too

View Full Paper
BABoris AronovABAbdul BasitGTGianluca Tasinato

Key Points

Key points are not available for this paper at this time.

Abstract

An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in R³ 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 R³ 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 R³ 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~R³ (with prescribed normal direction of one of the planes) in time O^* (n^5/2).

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Aronov et al. (2024) studied this question.

synapsesocial.com/papers/68e75ddfb6db6435876d531ahttps://doi.org/10.48550/arxiv.2403.02627
Ask AI
Helpful
Bookmark
Share
View Full Paper