Title :
Minimization of presentation of digital charts
Author :
Cherkaskyy, V.M. ; Voloshok, O.V.
Author_Institution :
Lviv Polytech. Nat. Univ., Lviv, Ukraine
Abstract :
The research of methods and algorithms of minimization of computer charts is resulted. The methods of analysis of complication of charts and methods of minimization namely bends crossings and the lengths of lines.
Keywords :
charts; computer facilities; minimisation; bends crossings method; computer charts; digital charts presentation; line length method; minimization; Linear programming; Minimization methods; Optimization methods; Reflection; algorithm of Prima; algorithm of Steiner´s tree; algorithm of branches and bounds; bends; crossings; lengths of lines; linear programming; minimization of hindrances;
Conference_Titel :
Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET), 2010 International Conference on
Conference_Location :
Lviv-Slavske
Print_ISBN :
978-966-553-875-2
Electronic_ISBN :
978-966-553-901-8
