Skip to main content
SpringerLink
Log in

Searching connected components in very large grid graphs

  • Algorithmic And Network Considerations
  • Conference paper
  • First Online:
Book cover Graph-Theoretic Concepts in Computer Science (WG 1986)

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

Included in the following conference series:

  • 171 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. D.A. Joseph, W.H. Plantinga: On the Complexity of Reachibility and Motion Planning Questions, ACM Symp. On Comp. Geom., pp. 66–66 (1985)

    Google Scholar 

  2. J.T. Schwartz, M. Sharir: On the “Piano Movers” Problem. II. General Techniques for Computing Topological Properties of Real Algebraic Manifolds, Advances in Applied Mathematics 4, pp. 298–351 (1983)

    Article  Google Scholar 

  3. T. Lozano-Perez, Spatial Planning: A Configuration Space Approach, IEEE Trans. On Comp. Vol. C-32, pp. 108–120 (Feb. 1983)

    Google Scholar 

  4. R. Lumia, L. Shapiro, O. Zuniga: A New Connected Components Algorithm for Virtual Memory Computers, Comp. Vision, Graphics, and Image Processing 22, 287–300 (1983)

    Google Scholar 

  5. A. Aho, J. Hopcroft, J. Ullman, The Design and Analysis of Computer Algorithms, pp. 129–139, Addison-Wesley 1974

    Google Scholar 

  6. M. R. Garey, D. S. Johnson, Computers and Intractability, W. H. Freeman and Company, San Francisco, 1979

    Google Scholar 

  7. H. Samet, The Quadtree and related hierarchical data structures, Computing Surveys 16 (1984)

    Google Scholar 

  8. T. Whitted, An improved illumination model for shaded display, CACM 23, p. 343 (1980)

    Google Scholar 

  9. H.N. Gabow, R.E. Tarjan, A linear-time algorithm for a special case of disjoint set-union, pp. 246–251 FOCS (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik I, Universität Karlsruhe, Germany

    S. Abramowski & H. Müller

Authors
  1. S. Abramowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gottfried Tinhofer Gunther Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abramowski, S., Müller, H. (1987). Searching connected components in very large grid graphs. In: Tinhofer, G., Schmidt, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1986. Lecture Notes in Computer Science, vol 246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17218-1_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-17218-1_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47415-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation