Research of Automatic Drawing Scheduling Network Method Based on Force-Directed

Jie Wu; Qiu Quan Wang

doi:10.4028/www.scientific.net/AMM.722.338

Paper Titles

A Map Matching Algorithm Based on Fuzzy Logic
p.316

A Novel Method of Cone Fitting Based on 3D Point Cloud
p.321

Multi-View Registration Based on Triangle Constraint and Global Optimization
p.327

Decorrelation-Based Data Association Algorithm for Heterogeneous Sensors System
p.334

Research of Automatic Drawing Scheduling Network Method Based on Force-Directed
p.338

3D Modeling of the Tower Head Based on ObjectARX
p.344

Estimation of Optical Amplifiers with Limited Information Based on Optoelectronic Equivalent Model
p.348

Intelligent Monitoring of Key Sections in Public Transportation
p.353

Evaluation of Cylindricity Geometrical Error Based on Calculational Geometry
p.359

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 722Research of Automatic Drawing Scheduling Network...

Research of Automatic Drawing Scheduling Network Method Based on Force-Directed

Abstract:

Automatic drawing algorithm has been one of the hotspot in research of drawing. So far there is no completely effective method. Force-directed graph drawing algorithm is based on physics model, makes the drawing problem into force for solving the problem in physics, then into unconstrained optimization for solving the problem in mathematics. Its advantage is based on people familiar with the physical model, and the principle is easy to understand. We can draw large-scale graphics with symmetrical and beautiful appearance through certain set and the improvement. At the advantages of Force-directed algorithm, this paper presents force-directed algorithm can be applied to automatic drawing in scheduling network, and explores the image style in a more intuitive graphical way to show the connection between scheduling network vertices.

You might also be interested in these eBooks

Mechanical Engineering, Manufacturing and Automation Technologies

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 722)

Pages:

338-343

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.722.338

Citation:

Cite this paper

Online since:

December 2014

Authors:

Jie Wu*, Qiu Quan Wang

Keywords:

Automatic Drawing, Force-Directed, Iteration, Scheduling Network

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Thomas M. J. Fruchterman and Edward M. Reingold: Graph Drawing by Force-Directed Placement, Software – Practice and Experience, vol. 21, Nov. 1991, pp.1129-1164.

DOI: 10.1002/spe.4380211102

Google Scholar

[2] Huang Jingwei, Kang Lishan, Chen Liuping: A new undirected graph drawing algorithm, Journal of Software, vol. 1, Nov. 2000, pp.138-142.

Google Scholar

[3] Zhang Qin, Zhu Li, Xia ZhaoJun: The drawing for work flow diagrams based on genetic algorithms, Computer and Digital Engineering, Apr. 2010, pp.125-127.

Google Scholar

[4] Sun Qiang: The force-guided scheduling algorithm of peak power optimization, Journal of University of Electronic Science and Technology, vol. 39, Jan. 2010, pp.137-140.

Google Scholar

[5] Xin Hua: The algorithm research for automatic mapping of distribution network line diagram, Yunnan Power Technology Forum Proceedings in 2010(L), (2010).

Google Scholar

[6] R. Chernobelskiy, K. Cunningham, M. T. Goodrich, S.G. Kobourov, L. Trott, (2011), Force-directed Lombardi-style graph drawing, Proc. 19th Symposium on Graph Drawing, pp.78-90.

DOI: 10.1007/978-3-642-25878-7_31

Google Scholar

[7] Stephen G. Kobourov: Spring Embedders and Force-Directed Graph Drawing Algorithms, (2012).

Google Scholar

[8] Bannister, M. J., Eppstein, D., Goodrich, M. T., Trott. L: Force-directed graph drawing using social gravity and scaling, Proc. 20th Int. Symp, Graph Drawing, (2012).

DOI: 10.1007/978-3-642-36763-2_37

Google Scholar