We introduce the mutation game on a directed multigraph,which is dual to Mozes5 numbers game.This new game allows us to create geometric and combinatorial structure that allows generalization of root systems to more g...We introduce the mutation game on a directed multigraph,which is dual to Mozes5 numbers game.This new game allows us to create geometric and combinatorial structure that allows generalization of root systems to more general graphs.We interpret Coxeter-Dynkin diagrams in this multigraph context and exhibit new geometric forms for the associated root systems.展开更多
The graph drawing and information visualization communities have developed many sophisticated techniques for visualizing network data, often involving complicated algorithms that are difficult for the uninitiated to l...The graph drawing and information visualization communities have developed many sophisticated techniques for visualizing network data, often involving complicated algorithms that are difficult for the uninitiated to learn. This article is intended for beginners who are interested in programming their own network visualizations, or for those curious about some of the basic mechanics of graph visualization. Four easy-to-program network layout techniques are discussed, with details given for implementing each one： force-directed node-link diagrams, arc diagrams, adjacency matrices, and circular layouts. A Java applet demonstrating these layouts, with open source code, is available at http：//www.michaelmcguffin.com/research/simpleNetVis/. The end of this article also briefly surveys research topics in graph visualization, pointing readers to references for further reading.展开更多
文摘We introduce the mutation game on a directed multigraph,which is dual to Mozes5 numbers game.This new game allows us to create geometric and combinatorial structure that allows generalization of root systems to more general graphs.We interpret Coxeter-Dynkin diagrams in this multigraph context and exhibit new geometric forms for the associated root systems.
基金Supported by the Natural Sciences and Engineering Research Council of Canada
文摘The graph drawing and information visualization communities have developed many sophisticated techniques for visualizing network data, often involving complicated algorithms that are difficult for the uninitiated to learn. This article is intended for beginners who are interested in programming their own network visualizations, or for those curious about some of the basic mechanics of graph visualization. Four easy-to-program network layout techniques are discussed, with details given for implementing each one： force-directed node-link diagrams, arc diagrams, adjacency matrices, and circular layouts. A Java applet demonstrating these layouts, with open source code, is available at http：//www.michaelmcguffin.com/research/simpleNetVis/. The end of this article also briefly surveys research topics in graph visualization, pointing readers to references for further reading.
