Force-Directed Method in Mirror Frames for Graph Drawing
Автор: Jing Lee, Ching-Hsing Pei
Журнал: International Journal of Intelligent Systems and Applications(IJISA) @ijisa
Статья в выпуске: 1 vol.2, 2010 года.
Бесплатный доступ
The most widely used algorithms for graph drawing are force-directed algorithms. We should modify a hybrid force model that is coupling a traditional spring force model and a novel repulsive force model will be proposed to solve the graph drawing problems in 2-D space. Especially, regular triangle drawing frame can be applied to binary tree drawing problems that on an important contribution to computer science. And apply circle drawing frame to normal graph drawing problems, we get satisfactory and aesthetic criteria graphics.
Graph drawing, force-directed algorithm, repulsive force model, hybrid force model, frame
Короткий адрес: https://sciup.org/15010078
IDR: 15010078
Список литературы Force-Directed Method in Mirror Frames for Graph Drawing
- N. Amare and A. Manning, “The Language of Visuals：Text + Graphics = Visual Rhetoric Tutorial,” IEEE Trans. on Professional Communication, Vol. 50, No.1, pp.57~70, 2007.
- D. –S. Kwon, T. –H. Yang, and Y. –J. Cho, “Mechatronics Technology in Mobile Devices,” IEEE Industrial Electronics Magazine, Vol.4, No.2, pp. 36~41, 2010.
- N. Elmqvist and J. –D. Fekete, “Hierarchical Aggregation for Information Visualization: Overview, Techniques, and Design Guidelines,” IEEE Trans. On Visualization and Computer Graphics, Vol.16, No.3, pp. 439~454, 2010.
- R. Barea, L. Boquete, M. Mazo, and E. Lopez, “System for Assisted Mobility Using Eye Movements Based on Electrooculography,” IEEE Trans. on Neural Systems and Rehabilitation Engineering, Vol. 10, No. 4, pp. 209~218, 2002.
- P. Liu and J. Guan, “Computer-Aided Industrial Design & Conceptual Design, ” IEEE 10th International Conference on CAID & CD 2009, pp. 1624~1627, 2009.
- M. Kaufmann and D. Wagner (Eds), Drawing Graphs:Methods and Models, New York: Springer, 2001.
- J. Diaz, J. Petit, and M. Serna, “A survey of graph layout problems, ”ACM Computing Surveys, vol. 34, no. 3, pp. 313-356, 2002.
- M. Kaufmann and D. Wagner (Eds), Drawing Graphs: Methods and Models, New York: Springer, 2001.
- T. M. J. Fruchterman and E. M. Reingold, “Graph drawing by force-directed placement,” Software—Practice and Experience, Vol. 21, No. 11, 1991, pp. 1129-1164.
- J. Lee, “Thermal placement algorithm based on heat conduction analogy,” IEEE Trans. On Components and Packaging Technologies, vol. 26, no. 2, pp. 473-482, 2003.
- J. Lee, “A reliability-driven placement procedure based on thermal force model,” Microelectronics Reliability, vol.46, no. 3-4, pp. 973-983, 2006.
- P. Eades, W. Huang, S.-H. Hong, “A force-directed method for large crossing angle graph drawing,” Technical report / University of Sydney. School of Information Technologies ; no. 640, 2009.
