DOCSLIB.ORG

GD 2000 Preliminary Program

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Wednesday, September 20, 2000 A Linear Time Implementation of SPQR-Trees Carsten Gutwenger, Max-Planck-Institut für Informatik 5:00 - 7:00 Registration and Reception Petra Mutzel, Technische Universität Wien Thursday, September 21, 2000 Labeling Points with Rectangles of Various Shapes Shin-ichi Nakano, Gunma University 8:45 – 9:45 Invited Talk GD 2000 Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe, Tohoku University Preliminary Program The Visual Representation of Information Structures How to Draw the Minimum Cuts of a Planar Colin Ware, University of New Hampshire Graph Colonial Williamsburg, Ulrik Brandes, Sabine Cornelsen, Dorothea 10:05 – 12:00 Empirical Studies & Standards Wagner, University of Konstanz Virginia, USA Chair: Wendy Feng September 20-23, 2000 User preference of graph layout aesthetics: a 3:40 – 5:35 Applications & Systems UML study Chair: Ashim Garg Helen C. Purchase, Jo-Anne Allder, David Carrington, The University of Queensland 2D-Structure Drawing of Similar Molecules J.D. Boissonnat, F. Cazals, J. Flötotto, INRIA A User Study in Similarity Measures for Graph Sophia-Antipolis Drawing Stina Bridgeman, Roberto Tamassia, Brown Fast Layout Methods for Timetable Graphs University Ulrik Brandes, Dorothea Wagner, University of Konstanz Interactive Partitioning (short paper) Galina Shubina, Roberto Tamassia, Brown Neal Lesh, Joe Marks, Maurizio Patrignani, University MERL—Mitsubishi Electric Research Labs An Algorithmic Framework for Visualizing An Experimental Comparison of Orthogonal Statecharts Compaction Algorithms R. Castello, R. Mili, I.G. Tollis, The University of Gunnar Klau, Karsten Klein, Max-Planck-Institut für Texas at Dallas Informatik Petra Mutzel, Technische Universität Wien Visualization of the Autonomous Systems Regular papers: 25 minutes Interconnections with Hermes GraphXML-An XML-based graph description Andrea Carmignani, Giuseppe Di Battista, Walter format Short papers: 15 minutes Didimo, Francesco Matera, Maurizio Pizzonia, I. Herman, M.S. Marshall, Centre for Mathematics Università di Roma Tre and Computer Sciences (CWI), The Netherlands Drawing hypergraphs in the subset standard 1:30 - 3:10 Theory I (short paper) Chair: Michael Kaufmann François Bertault, Peter Eades, University of Newcastle On Polar Visibility Representations of Graphs Joan P. Hutchinson, Macalester College Friday, September 22, 2000 k-layer Straightline Crossing Minimization by Saturday, September 23, 2000 Speeding up Sifting (short paper) Wolfgang Günther, Bernd Becker, Albert-Ludwigs 8:45 – 9:45 Invited Talk 9:00 – 10:30 Theory II University Robby Schönfeld, Paul Molitor, Martin-Luther Chair: Michael Goodrich Knowledge Discovery from Graphs University David Jensen, University of Massachusetts ω-Searchlight Obedient Graph Drawings 2:35 – 3:50 Orthogonal Drawing I Gill Barequet, The Technion---Israel Institute of 10:05 – 12:00 Force-Directed Layout Chair: Stephen Wismath Technology Chair: Stephen North Lower Bounds for the Number of Bends in Unavoidable configurations in complete A Multilevel Algorithm for Force-Directed Graph Three-Dimensional Orthogonal Graph Drawings topological graphs Drawing David R. Wood, The University of Sydney János Pach Courant Institute NYU and Hungarian C. Walshaw, University of Greenwich Academy of Sciences Orthogonal Drawings of Cycles in 3D Space Géza Tóth, Courant Institute NYU and MIT A Fast Multi-Scale Method for Drawing Large Giuseppe Di Battista, Università di Roma Tre Graphs Giuseppe Liotta, Università di Perugia Minimum Weight Drawings of Maximal David Harel, Yehuda Koren, Weizmann Institute of Anna Lubiw, University of Waterloo Triangulations Science Sue Whitesides, McGill University William Lenhart, Williams College Giuseppe Liotta, Università di Perugia FADE: Graph drawing, clustering and visual Three-Dimensional Orthogonal Graph Drawing abstraction with Optimal Volume A Layout Algorithm for Bar-visibility Graphs on Aaron Quigley, Peter Eades, University of Therese Biedl, University of Waterloo the Möbius Band (short paper) Newcastle Torsten Thiele, Frei Universität Berlin Alice M. Dean, Skidmore College David R. Wood, The University of Sydney A Fast Multi-Dimensional Algorithm for Drawing 10:50 – 12:30 Symmetry & Incremental Layout Large Graphs 4:10 – 5:00 Orthogonal Drawing II Chair: Dorothea Wagner Pawel Gajer, Michael T. Goodrich, Stephen G. Chair: Therese Biedl Kobourov, The Johns Hopkins University An Algorithm for Finding Three Dimensional A Linear-Time Algorithm for Bend-Optimal Symmetry in Trees GRIP: Graph dRawing with Intelligent Orthogonal Drawings of Biconnected Cubic Seok-Hee Hong, Peter Eades, University of Placement (short paper) Plane Graphs Newcastle Pawel Gajer, Stephen G. Kobourov, The Johns Shin-ichi Nakano, Makiko Yoshikawa, Gunma Hopkins University University On Maximum Symmetric Subgraphs Ho-Lin Chen, Hsu-Chun Yen, National Taiwan 1:10 – 2:15 k-Level Graph Layout Refinement of Three-Dimensional Orthogonal University Chair: Roberto Tamassia Graph Drawings Hsueh-I Lu, Academia Sinica Benjamin Y.S. Lynn, Antonios Symvonis, David R. A Fast Layout Algorithm for k-Level Graphs Wood, The University of Sydney Clan-Based Incremental Drawing Christoph Buchheim, Michael Jünger, Sebastian Fwu-Shan Shieh, Minolta QMS, Inc. Leipert, Universität zu Köln Evening Banquet Carolyn L. McCreary, Compaq Computer Corp. Graph Layout for Displaying Data Structures The Marey graph animation tool demo Vance Waddle, IBM Thomas J. Watson Research Carsten Friedrich, Peter Eades, University of Center Newcastle.
Recommended publications
  • Alaa AK Ismaeel

    Alaa AK Ismaeel

    Alaa A. K. Ismaeel Dynamic Hierarchical Graph Drawing Alaa A. K. Ismaeel Dynamic Hierarchical Graph Drawing Dynamic Hierarchical Graph Drawing by Alaa A. K. Ismaeel Dissertation, Karlsruher Instituts für Technologie (KIT), Fakultät für Wirtschaftswissenschaften, 2012 Tag der mündlichen Prüfung: 21. Mai 2012 Referent: Prof. Dr. Hartmut Schmeck, Institut für Angewandte Informatik und For- male Beschreibungsverfahren (AIFB), Karlsruher Instituts für Technologie (KIT), Karlsruhe, Germany. Korreferent: Prof. Dr. Jürgen Branke, Warwick Business School, The University of Warwick, Coventry, United Kingdom. Dynamic Hierarchical Graph Drawing Zur Erlangung des akademischen Grades eines Doktors der Wirtschaftswissenschaften (Dr. rer. pol.) von der Fakultät für Wirtschaftswissenschaften des Karlsruher Instituts für Technologie (KIT) genehmigte DISSERTATION von M.Sc. Alaa Aly Khalaf Ismaeel aus El-Minia, Ägypten Tag der mündlichen Prüfung: 21. Mai 2012 Referent: Prof. Dr. Hartmut Schmeck Korreferent: Prof. Dr. Jürgen Branke 2012 Karlsruhe Our Lord! Condemn us not if we forget, or miss the mark! ﺳﻮﺭﺓ ﺍﻟﺒﻘﺮﺓ – ﺁﻳﺔ ٢٨٦ Surah Al-Baqara – Verse 286 Acknowledgements First and foremost, my praise and deepest thanks are to God the Almighty for guiding me on the right path. Without HIS help and care, my efforts would have gone astray. Looking back, I feel immense gratitude to many people around me who have supported me while I was working on this Ph.D. thesis. The past four and a quarter years have given me many exciting, challenging and truly valuable experiences. This thesis is the result of a scholarship to carry out PhD in Computer Science at Karlsruhe Institute of Technology (KIT) in Germany. The scholarship was financially supported by the Egyptian Government (Egyptian Ministry of Higher Education) through the Egyptian Culture Bureau and Study Mission in Berlin.
  • A Brief History of Curves in Graph Drawing

    A Brief History of Curves in Graph Drawing

    A Brief History of Curves in Graph Drawing David Eppstein Computer Science Dept., University of California, Irvine Workshop on Drawing Graphs and Maps with Curves Dagstuhl, March 2012 Why curves? \It is not the right angle that attracts me, nor the straight line, hard and inflexible, created by man. What attracts me is the free and sensual curve|the curve that I find in the mountains of my country, in the sinuous course of its rivers, in the body of the beloved woman." | Oscar Niemeyer [2000] Amazon River near Fonte Boa, Amazonas, Brazil NASA WORDL WIND 4.1 Central Amazon River.jpg on Wikimedia commons Hand-generated graph drawings... ...have long used curves, independently of graph drawing research Multigraph for the polynomial 2 2 Example of a planar graph with an (x1 − x2) (x3 − x4) (x1 − x3) Euler path [Listing, 1848] (x1 − x4)(x2 − x3)(x2 − x4) [Petersen, 1891] Plimmer et al. [2009] study automated rearrangement of hand-drawn graphs, preserving features such as edge curves Curved graph drawings as art Mark Lombardi (1951{2000) World Finance Corporation and Associates, ca 1970{84: Miami, Ajman, and Bogota{Caracas (Brigada 2506: Cuban Anti-Castro Bay of Pigs Veteran), 7th version, 1999 Graphite on paper, 69 1=8 × 84 inches Hobbs [2003], Cat. no. 15, p. 71 Arc diagrams Vertices placed on a line; edges drawn on one or more semicircles Used by Saaty [1964] and Nicholson [1968] to count crossings Minimizing crossings is NP-hard [Masuda et al., 1990]; see Djidjev and Vrt'o [2002], Cimikowski [2002] for heuristics For st-planar graphs (or undirected
  • Graph Drawing �

    Graph Drawing

    Graph Drawing Pro ceedings of the ALCOM International Workshop on Graph Drawing Sevres Parc of Saint Cloud Paris Septemb er Edited by G Di Battista P Eades H de Fraysseix P Rosenstiehl and R Tamassia DRAFT do not distribute Septemb er ALCOM International Workshop on Graph Drawing Sevres Parc of Saint Cloud Paris Septemb er Graph drawing addresses the problem of constructing geometric representations of abstract graphs and networks It is an emerging area of research that combines avors of graph theory and computational geometry The automatic generation of drawings of graphs has imp ortant applications in key computer technologies such as software enginering database design and visual interfaces Further challenging applications can b e found in architectural design circuit schematics and pro ject management Research on graph drawing has b een esp ecially active in the last decade Recent progress in computational geometry top ological graph theory and order theory has considerably aected the evolution of this eld and has widened the range of issues b eing investigated This rst international workshop on graph drawing covers ma jor trends in the area Pap ers describ e theorems algorithms graph drawing systems mathematical and exp erimental analyses practical exp erience and a wide variety of op en problems Authors come from diverse academic cultures from graph theory computational geometry and software engineering Supp ort from ALCOM I I ESPRIT BA and by EHESS is gratefully acknowledged we would also like to thank Mr David Montgomery
  • Symmetric Graph Drawing

    Symmetric Graph Drawing

    3 Symmetric Graph Drawing 3.1 Introduction................................................. 87 3.2 Basic Concepts for Symmetric Graph Drawing ........ 89 Drawing of a graph • Automorphisms of a graph • Symmetries of a graph drawing 3.3 Characterization of Geometric Automorphism Groups 91 3.4 Finding Geometric Automorphisms ..................... 95 3.5 Symmetric Drawings of Planar Graphs ................. 98 Triconnected planar graphs • Biconnected planar graphs • One-connected planar graphs • Disconnected planar graphs • Peter Eades Drawing algorithms .................................................. University of Sydney 3.6 Conclusion 108 Further topics • Open problems Seok-Hee Hong Acknowledgments .................................................. 110 University of Sydney References ................................................... ....... 111 3.1 Introduction Symmetry is one of the most important aesthetic criteria that clearly reveals the structure and properties of a graph. Graphs in textbooks on graph theory are normally drawn sym- metrically. In some cases, a symmetric drawing may be preferred over a planar drawing. As an example, consider the two drawings of the same graph in Figure 3.1 (from [KK89]). The left drawing has five edge crossings, but eight symmetries (four rotations and four re- flections). On the right is a planar drawing; it only has axial symmetry. Most people prefer the drawing on the left. As another example, the Petersen graph is normally drawn as in Figure 3.2. This drawing shows ten symmetries (five rotations and five reflections). In fact, it can be shown that a drawing of the Petersen graph can have at most ten symmetries, and Figure 3.2 is maximally symmetric. Of course, every drawing has the trivial symmetry, the identity mapping on the plane. The aim of symmetric graph drawing is to draw a graph with nontrivial symmetry.
  • Algorithms for Drawing Graphs: an Annotated Bibliography∗

    Algorithms for Drawing Graphs: an Annotated Bibliography∗

    Algorithms for Drawing Graphs: an Annotated Bibliography∗ Giuseppe Di Battista Peter Eades Dipartimento di Informatica e Sistemistica Department of Computer Science Universit`a di Roma \La Sapienza" University of Newcastle Via Salaria, 113 | Roma University Drive | Callaghan 00198 Italy NSW 2308, Australia [email protected] [email protected] Roberto Tamassia Ioannis G. Tollis Department of Computer Science Department of Computer Science Brown University The University of Texas at Dallas Providence, RI 02912{1910 Richardson, Texas 75083{0688 USA USA [email protected] [email protected] June 1994 Abstract Several data presentation problems involve drawing graphs so that they are easy to read and un- derstand. Examples include circuit schematics and software engineering diagrams. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of Computer Science. This bibliogra- phy constitutes an attempt to encompass both theoretical and application oriented papers from disparate areas. ∗This document is available via anonymous ftp from wilma.cs.brown.edu (128.148.19.15),files /pub/papers/compgeo/gdbiblio.tex.Z and /pub/papers/compgeo/gdbiblio.ps.Z. Contents 1 Introduction 2 2 Background 4 3 Trees 5 3.1RootedTrees............................................. 5 3.2FreeTrees............................................... 6 4 General Graphs 7 4.1Straight-LineDrawings........................................ 8 4.2Planarization............................................. 9 4.3 Polyline Drawings . 11 5 Planar Graphs 11 5.1PlanarityTestingandPlanarRepresentations........................... 11 5.2Straight-LineDrawings........................................ 13 5.3 Orthogonal Grid Drawings . 15 5.4 Visibility Representations . 16 5.5 Other Graphic Standards . 18 6 Directed Graphs 20 6.1AcyclicDigraphs..........................................