Animation of curve constrained drawings of planar graphs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Animation of curve constrained drawings of planar graphs

Full text

Pdf (59 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the twenty-first annual symposium on Computational geometry table of contents

Pisa, Italy

SESSION: Video/multimedia presentations table of contents

Pages: 374 - 375

Year of Publication: 2005

ISBN:1-58113-991-8

Authors

Kim Hansen	University of Lethbridge, Lethbridge, AB, Canada
Stephen Wismath	University of Lethbridge, Lethbridge, AB, Canada

Sponsors

ACM: Association for Computing Machinery
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): 5, Downloads (12 Months): 20, Citation Count: 0

Additional Information:

abstract references 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/1064092.1064153 What is a DOI?

ABSTRACT

We submit an animation of an algorithm for drawing an arbitrary planar graph with vertices located on a semi-circle and edges drawn as straight line segments with at most one bend per edge. The animation,produced in .avi format, is available at:www.cs.uleth.ca/~vpak/socg05 .

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	H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorical, 10:41--51, 1990.
	2	Emilio Di Giacomo , Walter Didimo , Giuseppe Liotta , Stephen K. Wismath, Curve-constrained drawings of planar graphs, Computational Geometry: Theory and Applications, v.30 n.1, p.1-23, January 2005 [doi>10.1016/j.comgeo.2004.04.002]
	3	M. Kaufmann and R. Wiese. Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications, 6(1):115--129, 2002.