Fractional Lengths and Crossing Numbers
Adamec and Nešetřil  proposed a new the so called fractional length criterion for measuring the aesthetics of (artistic) drawings. They proposed to apply the criterion to the aesthetic drawing of graphs. In the graph drawing community, it is widely believed and even experimentally confirmed that the number of crossings is one of the most important aesthetic measures for nice drawings of graphs . The aim of this note is to demonstrate on two standard graph drawing models that in provably good drawings, with respect to the crossing number measure, the fractional length criterion is closely related to the crossing number criterion.
- 1.Adamec, J., Nešetřil, J.: Towards an Aesthetic Invariant for Graph Drawing. In: 9th Intl. Symp. on Graph Drawing. LNCS 2265. Springer. Berlin (2001) 287–296Google Scholar
- 2.Bhatt, S., Leighton, F. T.: A Framework for Solving VLSI Graph Layout Problems. J. Computer and System Science 28 (1984) 300–334Google Scholar
- 3.Di Battista, G., Eades, P., Tollis, I., Tamassia, R.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall (1999)Google Scholar
- 5.Leiserson, C. E.: Area Efficient Graph Layouts (for VLSI). In: 21st AnnualSymp osium on Foundations of Computer Science. IEEE Press (1980) 270–281Google Scholar
- 6.Purchase, H.: Which aestethic has the greatest effect on Human Understanding? In: 5th Intl. Symp. on Draph Drawing. LNCS 1353. Springer. Berlin (1997) 248–261Google Scholar
- 9.Thompson, C. D.: Area-Time Complexity for VLSI. In: 11th Annual ACM Symposium on Theory of Computing. ACM Press (1979) 81–89Google Scholar