Browsing by Subject "Drawing (graphics)"
Now showing 1 - 6 of 6
Results Per Page
Sort Options
Item Open Access CiSE: a circular spring embedder layout algorithm(Institute of Electrical and Electronics Engineers, 2013) Dogrusoz, U.; Belviranli, M. E.; Dilek, A.We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring embedder. Heuristics such as reversal of the order of nodes in a cluster and swap of neighboring node pairs in the same cluster are employed intermittently to further relax the spring embedder system, resulting in reduced inter-cluster edge crossings. Unlike other algorithms generating circular drawings, our algorithm does not require the quotient graph to be acyclic, nor does it sacrifice the edge crossing number of individual clusters to improve respective positioning of the clusters. Moreover, it reduces the total area required by a cluster by using the space inside the associated circle. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory, surpassing previous algorithms. The algorithm has also been successfully implemented and made publicly available as part of a compound and clustered graph editing and layout tool named Chisio. © 1995-2012 IEEE.Item Open Access A compound graph layout algorithm for biological pathways(Springer, Berlin, Heidelberg, 2004-09-10) Doğrusöz, Uğur; Giral, Erhan; Çetintaş, Ahmet; Çivril, Ali; Demir, EmekWe present a new compound graph layout algorithm based on traditional force-directed layout scheme with extensions for nesting and other application-specific constraints. The algorithm has been successfully implemented within PATIKA, a pathway analysis tool for drawing complicated biological pathways with compartimental constraints and arbitrary nesting relations to represent molecular complexes and pathway abstractions. Experimental results show that execution times and quality of the produced drawings with respect to commonly accepted layout criteria and pathway drawing conventions are quite satisfactory. © Springer-Verlag Berlin Heidelberg 2004.Item Open Access Disconnected graph layout and the polyomino packing approach(Springer, Berlin, Heidelberg, 2002) Freivalds, K.; Doğrusöz, Uğur; Kikusts, P.We review existing algorithms and present a new approach for layout of disconnected graphs. The new approach is based on polyomino representation of components as opposed to rectangles. The parameters of our algorithm and their influence on the drawings produced as well as a variation of the algorithm for multiple pages are discussed. We also analyze our algorithm both theoretically and experimentally and compare it with the existing ones. The new approach produces much more compact and uniform drawings than previous methods. © Springer-Verlag Berlin Heidelberg 2002.Item Open Access Graph drawing contest report(Springer, 2009-09) Doğrusöz, Uğur; Duncan, C. A.; Gutwenger, C.; Sander, G.This report describes the 15th Annual Graph Drawing Contest, held in conjunction with the 2008 Graph Drawing Symposium in Heraklion, Crete, Greece. The purpose of the contest is to monitor and challenge the current state of graph-drawing technology.Item Open Access Identification of illustrators(2012-10) Şener Fadime; Samet, Nermin; Duygulu-Şahin PınarThis paper is motivated by a book in which artists and illustrators from all over the world offer their personal interpretations of the declaration of human rights in pictures [1]. It was enthusiastic for a young reader to see an illustration of an artist that he already knows from his books . The characters were different, the topic was irrelevant, but still it was easy to identify the illustrators based on the style of the illustration. Inspired by the human's ability to identify illustrators, in this study we propose a method that can automatically learn to distinguish illustrations of different illustrators using computer vision techniques. © 2012 Springer-Verlag.Item Open Access Turkey: a report on computer graphics education(Technews, 1996) Özgüç, B.In a formal or an informal manner, computer graphics has been a field of research and education since the early 1970s in Turkey. The earlier examples of academic research work came from Istanbul Technical University and Middle East Technical University in Ankara. Istanbul Technical University research efforts were basically on computer-aided design, whereas at the Middle East Technical University, more theoretical computer graphics work has been carried on.Two examples can be given of early theoretical graphics work: A hidden line elimination algorithm by Ibrahim Canbulat, and an automated drafting algorithm by the author [2, 3]. To the best of my knowledge, the earliest official computer graphics course was offered at the Middle East Technical University in 1979. With the establishment of Bilkent University in Ankara, the first private university in Turkey, computer graphics became an official track of study, not only in computer engineering, but in fine arts as well.In this paper, we examine the current state of computer graphics education in Turkey under two main headings. First, the educational activities within the departments of computer science will be examined. Then, the educational activities within the schools of art and design will be looked at. In order to find out the educational activities at various universities, we have written to 52 departments at 40 universities. The information given in this report is based on the responses from these departments. Many departments at various schools offer technical drawing courses by the use of drafting software. These have not been classified as computer graphics courses.