Distance visibility graphs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Distance visibility graphs

Full text

Pdf (722 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the seventh annual symposium on Computational geometry table of contents

North Conway, New Hampshire, United States

Pages: 289 - 296

Year of Publication: 1991

ISBN:0-89791-426-0

Authors

Collette Coullard	Dept. of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois
Anna Lubiw	Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 23, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/109648.109681 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ACP	Stefan Arnborg , Derek G. Corneil , Andrzej Proskurowski, Complexity of finding embeddings in a k-tree, SIAM Journal on Algebraic and Discrete Methods, v.8 n.2, p.277-284, April 1, 1987 [doi>10.1137/0608024]
	AP	Stefan Arnborg , Andrzej Proskurowski, Characterization and recognition of partial 3-trees, SIAM Journal on Algebraic and Discrete Methods, v.7 n.2, p.305-314, April 1986 [doi>10.1137/0607033]
	CM	L. Cat and F. Maffray, private communication, 1990.
	Ch	B. Chazelle, to appear in Proc. 31st IEEE Symp. on Foundations of Computing, 1990.
	EC	H. Everett , D. G. Corneil, Recognizing visibility graphs of spiral polygons, Journal of Algorithms, v.11 n.1, p.1-26, Mar. 1990 [doi>10.1016/0196-6774(90)90026-B]
	E-G	Hossam Ahmed Elgindy, Hierarchical decomposition of polygons with applications, 1985
	Gh	Subir Kumar Ghosh, On recognizing and characterizing visibility graphs of simple polygons, No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory, p.96-104, January 1988, Halmstad, Sweden
	H	J. Hershberger, Finding the visibility graph of a simple polygon in time proportional to its size, Proceedings of the third annual symposium on Computational geometry, p.11-20, June 08-10, 1987, Waterloo, Ontario, Canada [doi>10.1145/41958.41960]
	HT	J. Hopcroft and R.E. Tarjan, Dividing a graph into triconnected components, SIAM J. Computing 2, 1973, 135-158.
	O'R	Joseph O'Rourke, Art gallery theorems and algorithms, Oxford University Press, Inc., New York, NY, 1987
	O'R2	J. O'Rourke, Recovery of convexity from visibility graphs, manuscript, 1990.
	PS	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	OW	M. H. Overmars , E. Welzl, New methods for computing visibility graphs, Proceedings of the fourth annual symposium on Computational geometry, p.164-171, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73410]
	RS	N. Robertson and P.D. Seymour, Graph minors II. Algorithmic aspects of tree width, J. of Algorithms 7, 1986, 309-322.
	Sa	J.B. Saxe, Two papers on graph embedding problems, Technical Report CMU-CS-80-102, Dept. of Computer Science, Carnegie Mellon University, 1980.
	To	Philip Todd, A k-tree generalization that characterized consistency of dimensioned engineering drawings, SIAM Journal on Discrete Mathematics, v.2 n.2, p.255-261, May 1989 [doi>10.1137/0402022]
	TY	Robert E. Tarjan , Mihalis Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM Journal on Computing, v.13 n.3, p.566-579, August 1984 [doi>10.1137/0213035]
	Ya	M. Yannakakis, Edge deletion problems, SIAM J. Computing 10, 1981, 297-309.
	Ye	Y. Yemeni, On some theoretical aspects of position-location problems, Proc. 10th IEEE Symp. on Foundations of Computer Science, 1979, 1-8.

CITED BY 2

	Joseph O'Rourke, Computational geometry column 18, ACM SIGACT News, v.24 n.1, p.20-25, Winter 1993
	Marshall S. Veach, Recognition and reconstruction of visibility graphs using a genetic algorithm, Proceedings of the First Annual Conference on Genetic Programming, July 28-31, 1996, Stanford, California