Geometry of planar graphs with angles

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Geometry of planar graphs with angles

Full text

Pdf (594 KB)

Source

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

Yorktown Heights, New York, United States

Pages: 116 - 124

Year of Publication: 1986

ISBN:0-89791-194-6

Author

V Vijayan

School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Georgia

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): 6, Downloads (12 Months): 16, Citation Count: 4

Additional Information:

references cited by index terms peer to peer

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/10515.10528 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.

	1	Aspvall, B., Shiloach, Y., "A polynomhl time algorithm for solving systems of linear inequalities with two variables per inequality", Proc. 20th Annual Symposium on Foundations of Computer Science, 1979.
	2	Baker, B. S., "Approximation Algorithms for NP-cx)mplete Problems on Planar Grap~", Proc. 24th Annual Symposium on Foundations of Computer Science, 1983.
	3	John Adrian Bondy, Graph Theory With Applications, Elsevier Science Ltd, 1976
	4	Coxeter, H. S. M., Introduction to Geometry, John Wiley & Sons, 1961.
	5	Fary, I., "On straight line representations of planar graphs", Acta $ci. Math. $zeged, No. 11, 1948.
	6	Cxrtmbaum, B., Shephard, G. C., "The geometry of planar graphs", Proc. 8th British Combinatorial Conference, 1981.
	7	Johnson, D. S., "The NP-Completeness Column: An Ongoing Guide", Journal of Algorithms, 3, 1982. (result attribute~ to A. Mansfield).
	8	N. Karmarkar, A new polynomial-time algorithm for linear programming, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.302-311, December 1984 [doi>10.1145/800057.808695]
	9	Richard J. Lipton , Jacobo Valdes , Gopalakrishnan Vijayan , Stephen C. North , Robert Sedgewick, VLSI Layout as Programming, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.3, p.405-421, July 1983 [doi>10.1145/2166.357216]
	10	Carver Mead , Lynn Conway, Introduction to VLSI Systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1979
	11	horn, C., "Defomfiom of Plane Graphs", Journal of Combinatorial Theory, Series B 34, 1983.
	12	Gopalakrishnan Vijayan, Design implementation and theory of a vlsi layout language, 1983
	13	Vijayan, G., Wigderson, A., "Planari~ of Edge- Ordered Graphs", Techm'cal Relnn't 307, l~partmerit of EF_X2S, Princeton University, ~mber 1982.
	14	Vijayan, O., Wigderson, A., "R near Cxmphs and their EmbeAdings", SlAM Journal of Computing, Vol. 14, No. 2, May 1985.
	15	Yaglom, i. M., Geometric Transformations, Vol 1 & 2, (Wamhted from Russian by Allen Shields), Random House, 1961 & 1968.

CITED BY 4

	Leonidas Guibas , John Hershberger, Morphing simple polygons, Proceedings of the tenth annual symposium on Computational geometry, p.267-276, June 06-08, 1994, Stony Brook, New York, United States
	Giuseppe Di Battista , Giuseppe Liotta , Anna Lubiw , Sue Whitesides, Embedding problems for paths with direction constrained edges, Theoretical Computer Science, v.289 n.2, p.897-917, 30 October 2002
	H. C. Purchase , R. F. Cohen , M. I. James, An experimental study of the basis for graph drawing algorithms, Journal of Experimental Algorithmics (JEA), 2, p.4-es, 1997
	Giuseppe Di Battista , Luca Vismara, Angles of planar triangular graphs, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.431-437, May 16-18, 1993, San Diego, California, United States