Monotone Drawings of Graphs with Fixed Embedding
暂无分享,去创建一个
Antonios Symvonis | Walter Didimo | Stephen G. Kobourov | Stephen K. Wismath | Tamara Mchedlidze | Patrizio Angelini | Vincenzo Roselli
[1] Takao Nishizeki,et al. Planar Graphs: Theory and Algorithms , 1988 .
[2] Frank Thomson Leighton,et al. Some Results on Greedy Embeddings in Metric Spaces , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[3] Weidong Huang,et al. A graph reading behavior: Geodesic-path tendency , 2009, 2009 IEEE Pacific Visualization Symposium.
[4] Christos H. Papadimitriou,et al. On a Conjecture Related to Geometric Routing , 2004, ALGOSENSORS.
[5] Giuseppe Di Battista,et al. Monotone Drawings of Graphs , 2010, Graph Drawing.
[6] Norishige Chiba,et al. Drawing plane graphs nicely , 1985, Acta Informatica.
[7] M. N. Shanmukha Swamy,et al. Graphs: Theory and Algorithms , 1992 .
[8] Roberto Tamassia,et al. On-line maintenance of triconnected components with SPQR-trees , 1996, Algorithmica.
[9] R. Tamassia,et al. Upward planarity testing , 1995 .
[10] Roberto Tamassia,et al. On-Line Planarity Testing , 1989, SIAM J. Comput..
[11] Petra Mutzel,et al. A Linear Time Implementation of SPQR-Trees , 2000, GD.
[12] Ioannis G. Tollis,et al. Graph Drawing , 1994, Lecture Notes in Computer Science.
[13] Esther M. Arkin,et al. On monotone paths among obstacles with applications to planning assemblies , 1989, SCG '89.
[14] Journal für die reine und angewandte Mathematik , 1893 .
[15] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..
[16] M. Stern. Ueber eine zahlentheoretische Funktion. , 1858 .