Partitioning Point Sets in 4 Dimensions

Richard Cole

Abstract: We introduce a new type of partition called a parallel planes partition. We prove there exists a parallel planes partition of any set of n points in 4 dimensions. This partition yields a data structure for the half-space retrieval problem in 4 dimensions; it has linear size and achieves a sublinear query time.