Author:
Eppstein David,Holten Danny,Löffler Maarten,Nöllenburg Martin,Speckmann Bettina,Verbeek Kevin
Publisher
Springer International Publishing
Reference17 articles.
1. Lecture Notes in Computer Science;M.A. Bekos,2013
2. Collins, C.R., Stephenson, K.: A circle packing algorithm. Comput. Geom. Theory Appl. 25(3), 233–256 (2003)
3. Cui, W., Zhou, H., Qu, H., Wong, P.C., Li, X.: Geometry-based edge clustering for graph visualization. IEEE TVCG 14(6), 1277–1284 (2008)
4. Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: Visualizing non-planar diagrams in a planar way. J. Graph. Algorithms Appl. 9(1), 31–52 (2005)
5. Lecture Notes in Computer Science;T. Dwyer,2007
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 10 Reasons to Get Interested in Graph Drawing;Lecture Notes in Computer Science;2019
2. Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization;IEEE Transactions on Visualization and Computer Graphics;2017-01
3. The Bundled Crossing Number;Lecture Notes in Computer Science;2016
4. Scalability Considerations for Multivariate Graph Visualization;Multivariate Network Visualization;2014
5. Balanced Circle Packings for Planar Graphs;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2014