Guy Melançon

Learn More
!"#$%&'$AB%'( '( # ()"19: -. 2"#$% 1'()#*'+#,'-. #./ .#1'2#,'-. ,9>%.'C)9(< #( )(9/ '. '.4-"5#,'-. 1'()#*'+#,'-.@ !"#$%( #$$9#" '. .)59"-)( #$$*'>#,'-.( ()>% #( D9E E"-D('.2< (,#,9F,"#.(','-. /'#2"#5(< #./ /#,# (,")>,)"9(@ B%9 #E'*',: ,1'()#*'+9 #./ ,.#1'2#,9 '. ,%9(9 $-,9.,'#**: *#"29< #E(,"#>, 2"#$%( '( -4,9. # >")>'#* $#", -4 #. #$$*'>#,'-.@ 3.4-"5#,'-.(More)
1 Department of Computer and Information Science, University of Konstanz, 78457 Konstanz, Germany, 2 Fraunhofer Institute for Intelligent Analysis and Information Systems(IAIS), Schloss Birlinghoven 53754 Sankt Augustin, Germany, 3 Université Paris-Sud, INRIA, Bât 490, F-91405 Orsay Cedex,(More)
Many networks under study in information visualization are "small world" networks. These networks first appeared in the study of social networks and were shown to be relevant models in other application domains such as software reverse engineering and biology. Furthermore, many of these networks actually have a multiscale nature: they can be viewed as a(More)
In this paper, we present an algorithm, called Bubble Tree, for the drawing of general rooted trees. A large variety of algorithms already exists in this field. However, the goal of this algorithm is to obtain a better drawing which makes a trade off between the angular resolution and the length of the edges. We show that the Bubble Tree drawing algorithm(More)
We present a multiscale MDS method extending Chalmers' pivot-based MDS algorithm (Morrison et al., 2003). Our multi-scale strategy is itself based on a 0(N log N) hybrid MDS approach. Our algorithm clearly improves over its predecessors with respect to time, while producing layouts of a comparable quality.
Many applications, from everyday file system browsers to visual programming tools, require the display of network and graph structures. The Graph Visualization Framework (GVF) is an architecture that supports the tasks common to most graph browsers and editors. This article gives a brief overview of the design of the GVF and focuses on the core classes that(More)
Two diierent factorizations of the Fibonacci innnite word were given independently in 10] and 6]. In a certain sense, these factorizations reveal a self-similarity property of the Fibonacci word. We rst describe the intimate links between these two factorizations. We then propose a generalization to characteristic sturmian words. R esum e. Deux(More)
Tulip is an information visualization framework dedicated to the analysis and visualization of relational data. Based on a decade of research and development of this framework, we present the architecture, consisting of a suite of tools and techniques, that can be used to address a large variety of domain-specific problems. With Tulip, we aim to provide the(More)