Skip to main content

On the zone of a surface in a hyperplane arrangement

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 519))

Abstract

Let H be a collection of n hyperplanes in ℝd, let A denote the arrangement of H, and let σ be a (d - 1)-dimensional algebraic surface of low degree, or the boundary of a convex body in ℝd. The zone of σ in A is the collection of cells of A crossed by σ. We show that the total number of faces bounding the cells of the zone of σ is O(n d−1 log n).

Work on this paper by the second author has been supported by Office of Naval Research Grant N00014-90-J-1284, by National Science Foundation Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the G.I.F. — the German Israeli Foundation for Scientific Research and Development, and the Fund for Basic Research administered by the Israeli Academy of Sciences.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Aronov and M. Sharir, On the complexity of a single cell in an arrangement of simplices in d-space, in preparation.

    Google Scholar 

  2. B. Aronov, J. Matoušek and M. Sharir, On the sum of squares of cell complexities in hyperplane arrangements, Proc. 7th Symp. on Computational Geometry, 1991, to appear.

    Google Scholar 

  3. M. Bern, D. Eppstein, P. Plassman, and F. Yao, Horizon theorems for lines and polygons, manuscript, 1990.

    Google Scholar 

  4. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.

    Google Scholar 

  5. H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel and M. Sharir, Arrangements of curves in the plane: Topology, combinatorics, and algorithms, Proc. 15th Int. Colloq. on Automata, Languages and Programming, 1988, pp. 214–229.

    Google Scholar 

  6. H. Edelsbrunner, R. Seidel and M. Sharir, On the zone theorem for hyperplane arrangements, in preparation.

    Google Scholar 

  7. B. Grünbaum, Convex Polytopes, Wiley, New York 1967.

    Google Scholar 

  8. M.E. Houle and T. Tokuyama, On zones of flats in hyperplane arrangements, manuscript, 1991.

    Google Scholar 

  9. M. Pellegrini, Combinatorial and algorithmic analysis of stabbing and visibility problems in 3-dimensional space, PhD Thesis, Courant Institute, New York University, February 1991.

    Google Scholar 

  10. M. Pellegrini, Ray-shooting and isotopy classes of lines in 3-dimensional space, in Proceedings of the 1991 Workshop on Algorithms and Data Structures, Ottawa, 1991.

    Google Scholar 

  11. M. Pellegrini, On the zone of a codimension p surface in a hyperplane arrangement, manuscript, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aronov, B., Sharir, M. (1991). On the zone of a surface in a hyperplane arrangement. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028245

Download citation

  • DOI: https://doi.org/10.1007/BFb0028245

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54343-5

  • Online ISBN: 978-3-540-47566-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics