Skip to main content
SpringerLink
Log in

Computing the rectilinear link diameter of a polygon

  • Conference paper
  • First Online:
Computational Geometry-Methods, Algorithms and Applications (CG 1991)

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

Included in the following conference series:

Abstract

The problem of finding the diameter of a simple polygon has been studied extensively in recent years. O(n log n) time upper bounds have been given for computing the geodesic diameter and the link diameter for a polygon.

We consider the rectilinear case of this problem and give a linear time algorithm to compute the rectilinear link diameter of a simple rectilinear polygon. To our knowledge this is the first optimal algorithm for the diameter problem of non-trivial classes of polygons.

This work was supported by the Deutsche Forschungs Gemeinschaft under Grant No. Ot 64/5-4.

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. Mark De Berg. On Rectilinear Link Distance. Technical Report RUU-CS-89-13, Department of Computer Science, University of Utrecht, P.O.Box 80.089, 3502 TB Utrecht, the Netherlands, May 1989.

    Google Scholar 

  2. M.T. de Berg, M.J. van Kreveld, B.J. Nilsson, M.H. Overmars. Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L 1 and Link Metric. In Proc. 2nd Scandinavian Workshop on Algorithm Theory, pages 213–224, 1990.

    Google Scholar 

  3. Bernard Chazelle. Triangulating a Simple Polygon in Linear Time. In Proc. 31th Symposium on Foundations of Computer Science, pages 220–230, 1990.

    Google Scholar 

  4. Yan Ke. An Efficient Algorithm for Link-distance Problems. In Proceedings of the Fifth Annual Symposium on Computational Geometry, pages 69–78, ACM, ACM Press, Saarbrücken, West Germany, June 1989.

    Google Scholar 

  5. Christos Levcopoulos. Heuristics for Minimum Decompositions of Polygons. PhD thesis, University of Linköping, Linköping, Sweden, 1987.

    Google Scholar 

  6. B.J. Nilsson, S. Schuierer. An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon. In 2nd Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, 1991.

    Google Scholar 

  7. Subhash Suri. Minimum Link Paths in Polygons and Related Problems. PhD thesis, Johns Hopkins University, Baltimore, Maryland, August 1987. pages 213–224, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut fur Informatik, Universität Freiburg, Rheinstr. 10-12, D-7800, Freiburg, Fed. Rep. of Germany

    Bengt J. Nilsson & Sven Schuierer

Authors
  1. Bengt J. Nilsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sven Schuierer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

H. Bieri H. Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nilsson, B.J., Schuierer, S. (1991). Computing the rectilinear link diameter of a polygon. In: Bieri, H., Noltemeier, H. (eds) Computational Geometry-Methods, Algorithms and Applications. CG 1991. Lecture Notes in Computer Science, vol 553. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54891-2_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-54891-2_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54891-1

  • Online ISBN: 978-3-540-46459-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation