Advertisement

Separating sets of hyperrectangles

  • Fabrizio d'Amore
  • Paolo Giulio Franciosa
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)

Abstract

We consider the problem of separating a given set of d-dimensional non-overlapping isothetic hyperrectangles by means of one cutting isothetic hyperplane. If the cutting hyperplane crosses one hyperrectangle this is split into two non-overlapping hyperrectangles. We show that there always exists a cutting hyperplane which separates n given hyperrectangles into two sets each containing no more than ⌈nd⌊ hyperrectangles, where αd=2d/(2d−1). Also, we show that it is not possible to do better. Moreover, we provide an O(d·n) time algorithm for finding this cutting hyperplane.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AHU74]
    Aho A. V., Hopcroft J. E. and Ullman J. D., The Design of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.Google Scholar
  2. [B75]
    Bentley J. L., “Multidimensional binary search trees used for associative searching”, Comm. ACML 18, 9 (Sept. 1975), 509–517.Google Scholar
  3. [B78]
    Baird H. S., “Fast Algorithms for LSI Artwork Analysis”, Design Automat. Fault-Tolerant Comput. 2, 2 (1978), 179–209.Google Scholar
  4. [dAF89]
    d'Amore F. and Franciosa P. G., “Static and Dynamic Management of Polylines in Geographical Applications”, Dept. Computer and System Science, Univ. of Rome “La Sapienza”, RAP.12.89, June 1989.Google Scholar
  5. [FR89]
    Faloutsos C. and Rego W., “Tri-cell—A data structure for spatial objects”, Information Systems, 14, 2 (1989), 131–139.Google Scholar
  6. [G84]
    Guttman A., “R-trees: a dynamic index structure for spatial searching”, Proc. ACM SIGMOD, 1984.Google Scholar
  7. [GW84]
    Güting R. H. and Wood D., “Finding Rectangle Intersections by Divide-and-Conquer”, IEEE Transactions on Computers c-33, 7 (1984), 671–675.Google Scholar
  8. [H82]
    Hasset J. E., “Automated Layout in ASHLER: an Approach to the Problem of General Cell Layout for VLSI”, Proc. 19 th Design Automation Conference ACM, SIGDA, IEEE, 1982, 777–784.Google Scholar
  9. [HN83]
    Hinrichs K. and Nievergelt J., “The grid file: a data structure designed to support proximity queries on spatial objects”, Proc. Workshop on Graph Theoretic Concepts in Computer Science, Osnabruck, 1983, 100–113.Google Scholar
  10. [L78]
    Lauther U., “4-dimensional Binary Search Trees as a mean to speed up associative searches in design-rule verification of integrated circuits”, Design Automat. Fault-Tolerant Comput. 2, 3 (1978), 241–247.Google Scholar
  11. [LT79]
    Lipton R. J. and Tarjan R. E., “A Separator Theorem for Planar Graphs”, SIAM J. Appl. Math. 36, 2 (1979), 177–189.Google Scholar
  12. [MC79]
    Mead C. A. and Conway L., Introduction to VLSI systems, Addison-Wesley, Reading, Mass., 1979.Google Scholar
  13. [MHN84]
    Matsuyama T., Hao L. and Nagao M., “A file organization for geographic information systems based on spatial proximity”, Comp. Vision and Image Process. 26, 3 (1984), 303–318.Google Scholar
  14. [NHS84]
    Nievergelt J., Hinterberger H. and Sevcik K. C., “The Grid File: An Adaptable, Symmetric Multikey File Structure”, ACM Trans. on Database Systems 9, 1 (March 1984), 38–71.Google Scholar
  15. [NW79]
    Nagy G. and Wagle S., “Geographic data processing”, ACM Computing Surveys 11, 2 (1979), 139–181.Google Scholar
  16. [R81]
    Robinson J. T., “The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes”, Proc. ACM SIGMOD, Ann Arbor, Michigan, 1981.Google Scholar
  17. [S88]
    Samet H., “Hierarchical Representation of Collections of Small Polygons”, ACM Computing Surveys 20, 4 (1988), 271–309.Google Scholar
  18. [SRSW84]
    Samet H., Rosenfeld A., Shaffer C. A. and Webber R. E., “Use of hierarchical data structures in geographic information systems”, Proc. of the Int. Symp. on Spatial Data Handling, Zurich 1984, vol. 2, edited by Marble, Brassle, Peuquet and Kishomoto, 392–411.Google Scholar
  19. [SW80]
    Six H. W. and Wood D., “The rectangle intersection problem revisited”, BIT 20, 1980, 426–433.Google Scholar
  20. [SW85]
    Samet H. and Webber E., “Storing a collection of polygons using quadtrees”, ACM Trans. on Graphics 4, 3 (1985), 182–222.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Fabrizio d'Amore
    • 1
  • Paolo Giulio Franciosa
    • 2
  1. 1.Department of Computer and System ScienceUniversity of Roma “La Sapienza”RomaItaly
  2. 2.Consiglio Nazionale delle RicercheIstituto di Analisi dei Sistemi ed InformaticaRomaItaly

Personalised recommendations