Graph drawing : 11th international symposium, GD 2003, Perugia, Italy, September 21-24, 2003 : revised papers / Giuseppe Liotta (ed.).
By: (11th : GD (Symposium) (11th : 2003 : Perugia, Italy)
Contributor(s): Liotta, Giuseppe, Ph. DMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 2912.Publisher: Berlin ; New York : Springer, 2004Description: 1 online resource (xv, 539 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 3540245952; 9783540245957; 1280306726; 9781280306723Subject(s): Computer graphics -- Congresses | Graph theory -- Congresses | Infographie -- Congrès | Graphes, Théorie des -- Congrès | COMPUTERS -- Image Processing | PHOTOGRAPHY -- Techniques -- Digital | TECHNOLOGY & ENGINEERING -- Imaging Systems | COMPUTERS -- Digital Media -- Graphics Applications | Computer graphics | Graph theory | Graphenzeichnen | Théorie des graphes | Dessin de graphes | Infographie | Perugia <2003>Genre/Form: Electronic books. | Conference papers and proceedings. | Perugia (2003) Additional physical formats: Print version:: Graph drawing.DDC classification: 006.6 LOC classification: T385 | .S884 2003Other classification: SS 4800 | DAT 756f Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
This book constitutes the thoroughly refereed post-proceedings of the 11th International Symposium on Graph Drawing, GD 2003, held in Perugia, Italy, in September 2003. The 34 revised full papers and 11 revised short papers presented were carefully selected during two rounds of reviewing and improvement. Also included are 6 posters, a report on the 2003 graph drawing contest, 2 invited contributions, as well as a comprehensive survey article presenting 42 challenging open problems in the area. The papers are organized in topical sections on planarity and planar drawings; geometric graph theory; application and systems; straight-line, circular, and circular-arc drawings; symmetrics; 3D-drawings; embeddings and triangulations; fixed parameter tractability; clusters, cuts, and orthogonal drawings; k-level drawings; force-directed and energy-based techniques; and surfaces and diagrams.
Planarity and Planar Drawings -- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way -- An Experimental Study of Crossing Minimization Heuristics -- Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm -- Bounds and Methods for k-Planar Crossing Numbers -- Geometric Graph Theory -- How Many Ways Can One Draw a Graph? -- Two Results on Intersection Graphs of Polygons -- Stretching of Jordan Arc Contact Systems -- Noncrossing Hamiltonian Paths in Geometric Graphs -- Applications and Systems -- Part I -- GraphAEL: Graph Animations with Evolving Layouts -- Visualizing Related Metabolic Pathways in Two and a Half Dimensions -- GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon -- System Demonstration -- Straight-Line, Circular, and Circular-Arc Drawings -- Area-Efficient Drawings of Outerplanar Graphs -- A Framework for User-Grouped Circular Drawings -- Fixed-Location Circular-Arc Drawing of Planar Graphs -- A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio -- Symmetries -- An Integer Programming Approach to Fuzzy Symmetry Detection -- Barycentric Drawings of Periodic Graphs -- 3D-Drawings -- Three-Dimensional Grid Drawings with Sub-quadratic Volume -- Laying Out Iterated Line Digraphs Using Queues -- Track Drawings of Graphs with Constant Queue Number -- 3D Visibility Representations of Complete Graphs -- Drawing Series-Parallel Graphs on Restricted Integer 3D Grids -- Nearly Optimal Three Dimensional Layout of Hypercube Networks -- Embeddings and Triangulations -- Graph Embedding with Minimum Depth and Maximum External Face -- More Efficient Generation of Plane Triangulations -- Planar Embeddings of Graphs with Specified Edge Lengths -- Applications and Systems -- Part II -- BGPlay: A System for Visualizing the Interdomain Routing Evolution -- GraphEx: An Improved Graph Translation Service -- A Constrained, Force-Directed Layout Algorithm for Biological Pathways -- Intersection-Free Morphing of Planar Graphs -- Fixed Parameter Tractability -- Fixed Parameter Algorithms for one-sided crossing minimization Revisited -- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization -- Clusters, Cuts, and Orthogonal Drawings -- Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles -- Convex Drawing for c-Planar Biconnected Clustered Graphs -- Layout of Directed Hypergraphs with Orthogonal Hyperedges -- No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs -- k-Level Drawings -- Radial Level Planarity Testing and Embedding in Linear Time -- An Improved Approximation to the One-Sided Bilayer Drawing -- Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves -- Force Directed and Energy-Based Techniques -- An Energy Model for Visual Graph Clustering -- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes -- Axis-by-Axis Stress Minimization -- Drawing Graphs with Nonuniform Nodes Using Potential Fields -- Surfaces and Diagrams -- Drawing Area-Proportional Venn and Euler Diagrams -- Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface -- Posters -- Degree Navigator TM : The Journey of a Visualization Software -- HexGraph: Applying Graph Drawing Algorithms to the Game of Hex -- GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions -- Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework -- The Puzzle Layout Problem -- Visual Data Mining with ILOG Discovery -- Graph Drawing Contest -- Graph Drawing Contest Report -- Invited Talks -- Engineering and Visualizing Algorithms -- Report on the Invited Lecture by Pat Hanrahan, Titled "On Being in the Right Space" -- Open Problems -- Selected Open Problems in Graph Drawing.