Force-Directed Method in Mirror Frames for Graph Drawing | Zendy

Jing Lee | Zendy; Ching-Hsing Pei | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Force-Directed Method in Mirror Frames for Graph Drawing

Author(s) -

Jing Lee,

Ching-Hsing Pei

Publication year - 2010

Publication title -

international journal of intelligent systems and applications

Language(s) - English

Resource type - Journals

eISSN - 2074-9058

pISSN - 2074-904X

DOI - 10.5815/ijisa.2010.01.02

Subject(s) - computer science , graph , graphics , frame (networking) , graph drawing , computer graphics , theoretical computer science , algorithm , computer graphics (images) , telecommunications

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research