Courses Pre-Required Visualization Using Force Directed Placement Technique
Visualizing “Courses – Pre – Required -
Architecture" on the screen has proven to be useful and helpful for
university actors and specially for students. In fact, these students
can easily identify courses and their pre required, perceive the
courses to follow in the future, and then can choose rapidly the
appropriate course to register in. Given a set of courses and their prerequired,
we present an algorithm for visualization a graph entitled
“Courses-Pre-Required-Graph" that present courses and their prerequired
in order to help students to recognize, lonely, what courses
to take in the future and perceive the contain of all courses that they
will study. Our algorithm using “Force Directed Placement"
technique visualizes the “Courses-Pre-Required-Graph" in such way
that courses are easily identifiable. The time complexity of our
drawing algorithm is O (n2), where n is the number of courses in the
“Courses-Pre-Required-Graph".
[1] I. Ammari, A. Barouni, M. Elloumi, "Modélisation et développement
d-une plateforme D-E-Learning pour l-Ecole Virtuelle de Tunis (EVT)
en appliquent l-algorithme de ressort," in International Conference on
New Technologies and Communication. Hassiba Ben Bouali University
of Chlef, Algeria, December, 2012, pp. 15-22.
[2] M. Alam, T.Biedl, S. Felsner, M. Kaufmann, S. Kobourov, "
Proportional Contact Representations of Planar Graphs," in the 19th
International Symposium Graph Drawing 2011. Eindhoven University of
Technology, Netherlands.
[3] A. Barouni, A. Jaoua, N. Zaguia, "Drawing Algorithms for
Telecommunication networks," in 3rd CGC workshop on Comptuational
Geometry. Brown University, Providence, RI, USA. October 1998.
[4] A. Barouni, A. Jaoua, N. Zaguia, "Planar Drawing Algorithms for
survivable telecommunications networks," in proceedings of the Japan
Conference on Discrete and Computational Geometry. Tokai University,
Japan. December 1998.
[5] A. Barouni, A. Jaoua, N. Zaguia, "An Inside and Outside Algorithm for
Drawing A Multi-Ring Architecture," in the International Journal
Machine GRaphics & Vision Vol. 9, Nos. ›. 2000.
[6] A. Barouni, "Algorithme De Dessin Des Couvertures D-anneaux
Utilisant L-emplacement Dirigé Par Des Forces," Phd Theses At The
University Of Tunisia. December 2002.
[7] G.Di Battista, C. Batini, M. Talamo, R. Tamassia, "Computer Aided
Layout Of Entity-Relationships Diagrams," The Journal Of Systems And
Software, Vol. 4, 1984.
[8] G.Di Battista, C. Batini, E. Nardelli, R. Tamassia, "A Layout Algorithm
For Data Flow Diagrams," Ieee Trans Software Eng., Vol. 12 1986.
[9] G. Di Battista, E. Pietrosanti, R. Tamassia, I.G. Tollis, "Automatic
Layout Of Pert Diagrams With Xpert, " Proc. Ieee Workshop On
Visual Languages (Vl-89).
[10] G.Di Battista, P. Eades, R. Tamassia, I.G. Tollis. "Algorithms For
Automatic Graph Drawing: An Annotated Bibliography," Department
Of Computer Science, Brown University, Technical Report, 1993.
[11] P.Eades, "A Heuristic For Graph Drawing, Congressus Numerantium,"
42, 49-160 (1984).
[12] Fruchterman, T.M.J, Reingold, E.M.: "Graph Drawing By Force
Directed Placement, Technical Report, Department Of Computer
Science," University of Illinois at Urbana-Champaign, Urbana, IL, 1990.
[1] I. Ammari, A. Barouni, M. Elloumi, "Modélisation et développement
d-une plateforme D-E-Learning pour l-Ecole Virtuelle de Tunis (EVT)
en appliquent l-algorithme de ressort," in International Conference on
New Technologies and Communication. Hassiba Ben Bouali University
of Chlef, Algeria, December, 2012, pp. 15-22.
[2] M. Alam, T.Biedl, S. Felsner, M. Kaufmann, S. Kobourov, "
Proportional Contact Representations of Planar Graphs," in the 19th
International Symposium Graph Drawing 2011. Eindhoven University of
Technology, Netherlands.
[3] A. Barouni, A. Jaoua, N. Zaguia, "Drawing Algorithms for
Telecommunication networks," in 3rd CGC workshop on Comptuational
Geometry. Brown University, Providence, RI, USA. October 1998.
[4] A. Barouni, A. Jaoua, N. Zaguia, "Planar Drawing Algorithms for
survivable telecommunications networks," in proceedings of the Japan
Conference on Discrete and Computational Geometry. Tokai University,
Japan. December 1998.
[5] A. Barouni, A. Jaoua, N. Zaguia, "An Inside and Outside Algorithm for
Drawing A Multi-Ring Architecture," in the International Journal
Machine GRaphics & Vision Vol. 9, Nos. ›. 2000.
[6] A. Barouni, "Algorithme De Dessin Des Couvertures D-anneaux
Utilisant L-emplacement Dirigé Par Des Forces," Phd Theses At The
University Of Tunisia. December 2002.
[7] G.Di Battista, C. Batini, M. Talamo, R. Tamassia, "Computer Aided
Layout Of Entity-Relationships Diagrams," The Journal Of Systems And
Software, Vol. 4, 1984.
[8] G.Di Battista, C. Batini, E. Nardelli, R. Tamassia, "A Layout Algorithm
For Data Flow Diagrams," Ieee Trans Software Eng., Vol. 12 1986.
[9] G. Di Battista, E. Pietrosanti, R. Tamassia, I.G. Tollis, "Automatic
Layout Of Pert Diagrams With Xpert, " Proc. Ieee Workshop On
Visual Languages (Vl-89).
[10] G.Di Battista, P. Eades, R. Tamassia, I.G. Tollis. "Algorithms For
Automatic Graph Drawing: An Annotated Bibliography," Department
Of Computer Science, Brown University, Technical Report, 1993.
[11] P.Eades, "A Heuristic For Graph Drawing, Congressus Numerantium,"
42, 49-160 (1984).
[12] Fruchterman, T.M.J, Reingold, E.M.: "Graph Drawing By Force
Directed Placement, Technical Report, Department Of Computer
Science," University of Illinois at Urbana-Champaign, Urbana, IL, 1990.
@article{"International Journal of Information, Control and Computer Sciences:52344", author = "Imen Ammari and Mourad Elloumi and Ala Eddine Barouni", title = "Courses Pre-Required Visualization Using Force Directed Placement Technique", abstract = "Visualizing “Courses – Pre – Required -
Architecture" on the screen has proven to be useful and helpful for
university actors and specially for students. In fact, these students
can easily identify courses and their pre required, perceive the
courses to follow in the future, and then can choose rapidly the
appropriate course to register in. Given a set of courses and their prerequired,
we present an algorithm for visualization a graph entitled
“Courses-Pre-Required-Graph" that present courses and their prerequired
in order to help students to recognize, lonely, what courses
to take in the future and perceive the contain of all courses that they
will study. Our algorithm using “Force Directed Placement"
technique visualizes the “Courses-Pre-Required-Graph" in such way
that courses are easily identifiable. The time complexity of our
drawing algorithm is O (n2), where n is the number of courses in the
“Courses-Pre-Required-Graph".", keywords = "Courses–Pre-Required-Architecture, Courses-Pre-
Required-Graph, Courses-Pre-Required-Visualization, Force directed
Placement, Resolution.", volume = "7", number = "4", pages = "471-5", }