Cantitate/Preț
Produs

Graph Drawing: 6th International Symposium, GD '98 Montreal, Canada, August 13-15, 1998 Proceedings: Lecture Notes in Computer Science, cartea 1547

Editat de Sue H. Whitesides
en Limba Engleză Paperback – 5 ian 1999

Din seria Lecture Notes in Computer Science

Preț: 33207 lei

Preț vechi: 41509 lei
-20% Nou

Puncte Express: 498

Preț estimativ în valută:
6356 6624$ 5291£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540654735
ISBN-10: 3540654739
Pagini: 488
Ilustrații: XII, 476 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.68 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Caracteristici

Includes supplementary material: sn.pub/extras