Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference28 articles.
1. Computing orthogonal drawings with the minimum number of bends;Bertolazzi;IEEE Trans. Computers,2000
2. A linear algorithm to find a rectangular dual of a planar triangulated graph;Bhasker;Algorithmica,1988
3. A better heuristic for orthogonal graph drawings;Biedl;Comput. Geom. Theory Appl.,1998
4. Area-efficient static and incremental graph drawings;Biedl,1997
5. Orthogonal and quasi-upward drawings with vertices of prescribed size;Di Battista,1999
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献