Graph drawing : 6th international symposium, GD '98, Montréal, Canada, August 13-15, 1998 : proceedings

Kaydedildi:
Detaylı Bibliyografya
Müşterek Yazar: Symposium on Graph Drawing :Montreal
Diğer Yazarlar: Whitesides, Sue H., 1946- (Yayın yönetmeni)
Materyal Türü: Livre numérique
Dil:Anglais
Baskı/Yayın Bilgisi: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Seri Bilgileri:Lecture notes in computer science 1547
Konular:
Online Erişim:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Not: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Graph drawing, 6th international symposium, GD '98, Montréal, Canada, August 13-15, 1998, proceedings, Sue H. Whitesides (ed.), 1998, New York, Springer, 1 vol. (XII-488 p.), Lecture notes in computer science, 3-540-65473-9
• Graph Drawing, Texte imprimé, 9783662168110
LEADER 05098nam a22004217a 4500
001 968982
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155165208
020 |a 9783540376231 (PDF) 
041 0 |a eng 
082 |a 511.5 
082 |a 004 
111 2 |a Symposium on Graph Drawing  |n (06  |d  :1998  |c  :Montreal). 
245 1 0 |a Graph drawing :  |b 6th international symposium, GD '98, Montréal, Canada, August 13-15, 1998 : proceedings   |c [edited by] Sue H. Whitesides. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 1547  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
650 |a Génie logiciel 
650 |a Informatique 
650 |a Théorie des graphes 
650 |a Algorithmes 
650 |a Infographie 
650 |a Analyse combinatoire 
650 |a Actes de congrès 
700 1 |a Whitesides, Sue H.,  |d 1946-  |4 pbd 
776 0 |0 045593108  |t Graph drawing  |o 6th international symposium, GD '98, Montréal, Canada, August 13-15, 1998  |o proceedings  |f Sue H. Whitesides (ed.)  |d 1998  |c New York  |n Springer  |p 1 vol. (XII-488 p.)  |s Lecture notes in computer science  |z 3-540-65473-9 
776 0 |t Graph Drawing  |b Texte imprimé  |z 9783662168110 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-37623-2  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-CRC9PJF1-X  |z Accès sur la plateforme Istex 
856 4 |5 452349901:750603216  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-37623-2  |z Accès Université d'Orléans 
856 4 |5 180339901:753963469  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-37623-2  |z Accès INSA CVL 
997 |0 968982  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/