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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Abello, K. Kumar, Visibility Graphs and Oriented Matroids, Lecture Notes in Computer Science, 894 (1994), pp. 147–158, Springer-Verlag, New York.
H. Everett, D.G. Corneil, “Recognizing Visibility Graphs of Spiral Polygons,” Journal of Algorithms (11) pp. 1–26, 1990.
H. Everett, Visibility Graph Recognition, PhD Dissertation, Department of Computer Science, University of Toronto, 1990.
J. Folkman, J. Lawrence, Oriented Matroids, Journal of Combinatorial Theory (B), 25 (1978), pp. 199–236.
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.
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.
J. O'Rourke, The Computational Geometry Column, SIGACT News, 1993.
S. Teller, P. Hanrahan, Global Visibility Algorithms for Illumination Computations, SIGGRAPH 93 Proceedings, pp 239–246, 1993.
Author information
Authors and Affiliations
Editor information
Rights 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