Graph Drawing 6th International Symposium, GD '98 Montreal, Canada, August 13-15, 1998 Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Whitesides, Sue H. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
Έκδοση:1st ed. 1998.
Σειρά:Lecture Notes in Computer Science, 1547
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05204nam a2200577 4500
001 978-3-540-37623-1
003 DE-He213
005 20191023221257.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 |a 9783540376231  |9 978-3-540-37623-1 
024 7 |a 10.1007/3-540-37623-2  |2 doi 
040 |d GrThAP 
050 4 |a QA76.76.A65 
072 7 |a UB  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a UB  |2 thema 
082 0 4 |a 004  |2 23 
245 1 0 |a Graph Drawing  |h [electronic resource] :  |b 6th International Symposium, GD '98 Montreal, Canada, August 13-15, 1998 Proceedings /  |c edited by Sue H. Whitesides. 
250 |a 1st ed. 1998. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1998. 
300 |a XII, 476 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1547 
505 0 |a Papers -- Drawing of Two-Dimensional Irregular Meshes -- Quasi-Upward Planarity -- Three Approaches to 3D-Orthogonal Box-Drawings -- Using Graph Layout to Visualize Train Interconnection Data -- Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms -- Upward Planarity Checking: "Faces Are More than Polygons" -- A Split&Push Approach to 3D Orthogonal Drawing -- Geometric Thickness of Complete Graphs -- Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs -- On Improving Orthogonal Drawings: The 4M-Algorithm -- Algorithmic Patterns for Orthogonal Graph Drawing -- A Framework for Drawing Planar Graphs with Curves and Polylines -- Planar Polyline Drawings with Good Angular Resolution -- A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order -- Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions -- Approximation Algorithms for Finding Best Viewpoints -- Level Planarity Testing in Linear Time -- Crossing Number of Abstract Topological Graphs -- Self-Organizing Graphs - A Neural Network Perspective of Graph Layout -- Embedding Planar Graphs at Fixed Vertex Locations -- Proximity Drawings: Three Dimensions Are Better than Two -- NP-Completeness of Some Tree-Clustering Problems -- Refinement of Orthogonal Graph Drawings -- A Combinatorial Framework for Map Labeling -- An Algorithm for Three-Dimensional Orthogonal Graph Drawing -- System Demonstrations -- Graph Multidrawing: Finding Nice Drawings Without Defining Nice -- Edge Labeling in the Graph Layout Toolkit -- Improved Force-Directed Layouts -- A Fully Animated Interactive System for Clustering and Navigating Huge Graphs -- Drawing Large Graphs with H3Viewer and Site Manager -- Cooperation between Interactive Actions and Automatic Drawing in a Schematic Editor -- Visualization of Parallel Execution Graphs -- JIGGLE: Java Interactive Graph Layout Environment -- Contest -- Graph-Drawing Contest Report -- Poster Abstracts -- Implementation of an Efficient Constraint Solver for the Layout of Graphs in Delaunay -- Planar Drawings of Origami Polyhedra -- Human Perception of Laid-Out Graphs -- Ptolomaeus:The Web Cartographer -- Flexible Graph Layout and Editing for Commercial Applications -- Multidimensional Outlines - Wordgraphs -- VisA: A Tool for Visualizing and Animating Automata and Formal Languages -- Elastic Labels on the Perimeter of a Rectangle -- VGJ: Visualizing Graphs Through Java -- A Library of Algorithms for Graph Drawing -- The Size of the Open Sphere of Influence Graph in L ? Metric Spaces -- Maximum Weight Triangulation and Graph Drawing -- Adding Constraints to an Algorithm for Orthogonal Graph Drawing -- On Computing and Drawing Maxmin-Height Covering Triangulation. 
650 0 |a Application software. 
650 0 |a Discrete mathematics. 
650 0 |a Algorithms. 
650 0 |a Combinatorics. 
650 0 |a Computer graphics. 
650 0 |a Software engineering. 
650 1 4 |a Computer Applications.  |0 http://scigraph.springernature.com/things/product-market-codes/I23001 
650 2 4 |a Discrete Mathematics.  |0 http://scigraph.springernature.com/things/product-market-codes/M29000 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Combinatorics.  |0 http://scigraph.springernature.com/things/product-market-codes/M29010 
650 2 4 |a Computer Graphics.  |0 http://scigraph.springernature.com/things/product-market-codes/I22013 
650 2 4 |a Software Engineering.  |0 http://scigraph.springernature.com/things/product-market-codes/I14029 
700 1 |a Whitesides, Sue H.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662168110 
776 0 8 |i Printed edition:  |z 9783540654735 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1547 
856 4 0 |u https://doi.org/10.1007/3-540-37623-2  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)