Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Lecture Notes in Computer Science;M. Bern,2001
2. MSRI Publications;J.W. Cannon,1997
3. Lecture Notes in Computer Science;R. Chernobelskiy,2012
4. Collins, C.R., Stephenson, K.: A circle packing algorithm. Comput. Geom. Th. Appl. 25(3), 233–256 (2003)
5. Di Battista, G., Tamassia, R.: Incremental planarity testing. In: 30th Symp. Foundations of Computer Science, pp. 436–441. IEEE (1989)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Map Drawing Approach for Airport Connectivity Using Coloring Algorithm;Micro-Electronics and Telecommunication Engineering;2023
2. On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings;Lecture Notes in Computer Science;2018
3. Lombardi Drawings of Knots and Links;Lecture Notes in Computer Science;2018
4. Planar Bus Graphs;Algorithmica;2017-05-16
5. Balanced Circle Packings for Planar Graphs;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2014