|
|
|
|
| LEADER |
04025nmm a2200373 u 4500 |
| 001 |
EB001884738 |
| 003 |
EBX01000000000000001048105 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
191115 ||| eng |
| 020 |
|
|
|a 9783540376231
|
| 100 |
1 |
|
|a Whitesides, Sue H.
|e [editor]
|
| 245 |
0 |
0 |
|a Graph Drawing
|h Elektronische Ressource
|b 6th International Symposium, GD '98 Montreal, Canada, August 13-15, 1998 Proceedings
|c edited by Sue H. Whitesides
|
| 250 |
|
|
|a 1st ed. 1998
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1998, 1998
|
| 300 |
|
|
|a XII, 476 p
|b online resource
|
| 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 --
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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 --
|
| 653 |
|
|
|a Computer graphics
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer Graphics
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Application software
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Computer and Information Systems Applications
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-37623-2
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-37623-2?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.3
|