Skip to main content
SpringerLink
Log in

Visibility graphs of 2-spiral polygons (Extended abstract)

  • Conference paper
  • First Online:
LATIN '95: Theoretical Informatics (LATIN 1995)

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

Included in the following conference series:

Abstract

In a previous paper, the authors reduced the characterization of visibility graphs of simple polygons to the coordinatization of certain uniform rank 3 oriented matroids. We show here that in the case of 2-spiral polygons such coordinatization is possible therefore characterizing visibility graphs of 2-spiral polygons.

Work partially supported by NSF grants No: DCR-8603722 and DCR-8896281.

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.

Similar content being viewed by others

References

  1. J. Abello, K. Kumar, Visibility Graphs and Oriented Matroids, Lecture Notes in Computer Science, 894 (1994), pp. 147–158, Springer-Verlag, New York.

    Google Scholar 

  2. H. Everett, D.G. Corneil, “Recognizing Visibility Graphs of Spiral Polygons,” Journal of Algorithms (11) pp. 1–26, 1990.

    Article  Google Scholar 

  3. H. Everett, Visibility Graph Recognition, PhD Dissertation, Department of Computer Science, University of Toronto, 1990.

    Google Scholar 

  4. J. Folkman, J. Lawrence, Oriented Matroids, Journal of Combinatorial Theory (B), 25 (1978), pp. 199–236.

    Article  Google Scholar 

  5. S. K. Ghosh, On Recognizing and Characterizing Visibility Graphs of Simple Polygons, Lecture Notes in Computer Science, 318 (1988), pp. 132–139, Springer-Verlag, New York.

    Google Scholar 

  6. T. Lozano-Perez and M. A. Wesley “An Algorithm for Planning Collision-Free Paths among Polyhedral Obstacles,” Communications of the ACM, (22) pp. 560–570, 1979.

    Article  Google Scholar 

  7. J. O'Rourke, The Computational Geometry Column, SIGACT News, 1993.

    Google Scholar 

  8. S. Teller, P. Hanrahan, Global Visibility Algorithms for Illumination Computations, SIGGRAPH 93 Proceedings, pp 239–246, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Texas A&M University, 77843, College Station, TX, USA

    James Abello

  2. Department of Mathematics and Computer Science, Colby College, 04901, Waterville, ME, USA

    Krishna Kumar

Authors
  1. James Abello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krishna Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ricardo Baeza-Yates Eric Goles Patricio V. Poblete

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abello, J., Kumar, K. (1995). Visibility graphs of 2-spiral polygons (Extended abstract). In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-59175-3_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59175-7

  • Online ISBN: 978-3-540-49220-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation