Algorithms and a language for the support of automatically laying out diagram elements

Abstract

<p>U sklopu doktorske disertacije izvršeno je istraživanje vezano za automatsko<br />raspoređivanje elemenata dijagrama. Kroz analizu postojećih rešenja uočen je<br />prostor za poboljšanja, posebno po pitanju raznovrsnosti dostupnih algoritama<br />i pomoći korisniku pri izboru najpogodnijeg od njih. U okviru istraživanja<br />proučavan, implementiran i u pojedinim slučajevima unapređen je širok<br />spektar algoritama za crtanje i analizu grafova. Definisan je postupak<br />automatskog izbora odgovarajućeg algoritma za raspoređivanje elemenata<br />grafova na osnovu njihovih osobina. Dodatno, osmišljen je jezik specifičan za<br />domen koji korisnicima grafičkih editora pruža pomoć u izboru algoritma za<br />raspoređivanje, a programerima brže pisanje koda za poziv željenog algoritma.</p>

<p>This thesis presents a research aimed towards the problem of automatically<br />laying out elements of a diagram. The analysis of existing solutions showed that there<br />is some room for improvement, especially regarding variety of available algorithms.<br />Also, none of the solutions offer possibility of automatically choosing an appropriate<br />graph layout algorithm. Within the research, a large number of different algorithms for<br />graph drawing and analysis were studied, implemented, and, in some cases,<br />enhanced. A method for automatically choosing the best available layout algorithm<br />based on properties of a graph was defined. Additionally, a domain-specific language<br />for specifying a graph&rsquo;s layout was designed.</p>