Author:
Angelini Patrizio,Cittadini Luca,Di Battista Giuseppe,Didimo Walter,Frati Fabrizio,Kaufmann Michael,Symvonis Antonios
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Bárány, I., Tokushige, N.: The minimum area of convex lattice n-gons. Combinatorica 24(2), 171–185 (2004)
2. Berge, C.: Graphs. North Holland, Amsterdam (1985)
3. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
4. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)
5. Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science 61, 175–198 (1988)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Acute Constraints in Straight-Line Drawings of Planar Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2019-09-01
2. Circular right-angle crossing drawings in linear time;Theoretical Computer Science;2016-08
3. The Crossing-Angle Resolution in Graph Drawing;Thirty Essays on Geometric Graph Theory;2012-10-29
4. Maximizing the Total Resolution of Graphs;The Computer Journal;2012-06-27
5. Graphs that admit right angle crossing drawings;Computational Geometry;2012-05