Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions

Abstract We prove tight and near-tight combinatorial complexity bounds for vertical decompositions of arrangements of hyperplanes and 3-simplices in four dimensions. In particular, we prove a tight upper bound of Θ(n4) for the vertical decomposition of an arrangement of n hyperplanes in four dimensions, improving the best previously known bound [8] by a logarithmic factor. We also show that the complexity of the vertical decomposition of an arrangement of n 3-simplices in four dimensions is O(n4 α (n) log2 n), where α (n) is the inverse Ackermann function, improving the best previously known bound [2] by a near-linear factor.

[1]  Kenneth L. Clarkson,et al.  A Randomized Algorithm for Closest-Point Queries , 1988, SIAM J. Comput..

[2]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[3]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[4]  Micha Sharir,et al.  Arrangements and Their Applications , 2000, Handbook of Computational Geometry.

[5]  Vladlen Koltun,et al.  Matching Polyhedral Terrains Using Overlays of Envelopes , 2004, Algorithmica.

[6]  Micha Sharir,et al.  On the Zone Theorem for Hyperplane Arrangements , 1991, SIAM J. Comput..

[7]  Leonidas J. Guibas,et al.  Vertical decompositions for triangles in 3-space , 1994, SCG '94.

[8]  Boaz Tagansky,et al.  A new technique for analyzing substructures in arrangements of piecewise linear surfaces , 1996, Discret. Comput. Geom..

[9]  Vladlen Koltun,et al.  Almost tight upper bounds for vertical decompositions in four dimensions , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[10]  Leonidas J. Guibas,et al.  Vertical decompositions for triangles in 3-space , 1994, SCG '94.

[11]  Leonidas J. Guibas,et al.  Vertical decomposition of arrangements of hyperplanes in four dimensions , 1993, Discret. Comput. Geom..

[12]  Leonidas J. Guibas,et al.  A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications , 1991, Theor. Comput. Sci..

[13]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.