Skip to main content
SpringerLink
Log in

Connectability problems

  • Conference paper
  • First Online:
SWAT 88 (SWAT 1988)

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

Included in the following conference series:

  • 146 Accesses

Abstract

In this paper we define a general class of problems in computational geometry that we call connectability problems. Connectability problems involve connecting objects by some kind of connections, avoiding obstacles. This includes many different types of problems like intersection problems, visibility problems, etc. Studying these problems in a general framework might lead to general solutions. Some solutions are presented. In particular, an O(n log nloglog n) solution is given for determining all pairs of points in a set that can be connected with an axis-parallel rectangle, avoiding a set of obstacle points.

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.

References

  1. de Berg, M.T., and M.H. Overmars, Dominance in the presence of obstacles, Techn. Rep. RUU-CS-88-10, Dept of Computer Science, University of Utrecht, 1988.

    Google Scholar 

  2. Edelsbrunner, H., and L. Guibas, Topological sweeping in an arrangement, Proc. 18th Symp. Theory of Computing, 1986, pp. 389–403.

    Google Scholar 

  3. Chew, L.P., and R.L. Drysdale, III, Voronoi diagrams based on convex distance functions, Proc. 1st ACM Symp. Computational Geometry, 1985, pp. 235–244.

    Google Scholar 

  4. Güting, R.H., O. Nurmi and T. Ottmann, The direct dominance problem, Proc. 1st ACM Symp. Computational Geometry, 1985, pp. 81–88.

    Google Scholar 

  5. Ghosh, S.K., and D.M. Mount, An output sensitive algorithm for computing visibility graphs, Proc. 28th Symp. on Foundations of Computer Science, 1987, pp. 11–19.

    Google Scholar 

  6. Karlsson, R.G., and M.H. Overmars, Normalized divide-and-conquer: A scaling technique for solving multi-dimensional problems, Inform. Proc. Lett. 26 (1987/88) pp. 307–312.

    Google Scholar 

  7. Munro, J.I., M.H. Overmars and D. Wood, Variations on visibility, Proc. 3rd ACM Symp. Computational Geometry, 1987, pp. 291–299.

    Google Scholar 

  8. Overmars, M.H., and E. Welzl, New methods for computing visibility graphs, Proc. 4th ACM Symp. Computational Geometry, 1988, to appear.

    Google Scholar 

  9. Overmars, M.H., and D. Wood, On rectangular visibility, J. Algorithms (1988), to appear.

    Google Scholar 

  10. van Emde Boas, P., Preserving order in a forest in less than logarithmic time and lineair space, Inform. Proc. Lett. 6 (1977) pp. 80–82.

    Google Scholar 

  11. van Emde Boas, R., R. Kaas and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory 10 (1977) pp. 99–127.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Utrecht, P.O.Box 80.089, 3508 TB, Utrecht, The Netherlands

    Mark H. Overmars

Authors
  1. Mark H. Overmars
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf Karlsson Andrzej Lingas

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Overmars, M.H. (1988). Connectability problems. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-19487-8_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19487-3

  • Online ISBN: 978-3-540-39288-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation