| 000 | 04825nam a22005895i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-37623-1 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132526.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1998 gw | s |||| 0|eng d | ||
| 020 |
_a9783540376231 _9978-3-540-37623-1 |
||
| 024 | 7 |
_a10.1007/3-540-37623-2 _2doi |
|
| 050 | 4 | _aQA76.76.A65 | |
| 072 | 7 |
_aUB _2bicssc |
|
| 072 | 7 |
_aCOM005000 _2bisacsh |
|
| 072 | 7 |
_aUX _2thema |
|
| 082 | 0 | 4 |
_a005.3 _223 |
| 245 | 1 | 0 |
_aGraph Drawing _h[electronic resource] : _b6th International Symposium, GD '98 Montreal, Canada, August 13-15, 1998 Proceedings / _cedited by Sue H. Whitesides. |
| 250 | _a1st ed. 1998. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1998. |
|
| 300 |
_aXII, 476 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1547 |
|
| 505 | 0 | _aPapers -- 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 | _aApplication software. | |
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aComputer graphics. | |
| 650 | 0 | _aSoftware engineering. | |
| 650 | 1 | 4 | _aComputer and Information Systems Applications. |
| 650 | 2 | 4 | _aDiscrete Mathematics. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aComputer Graphics. |
| 650 | 2 | 4 | _aSoftware Engineering. |
| 700 | 1 |
_aWhitesides, Sue H. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540654735 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662168110 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1547 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-37623-2 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c188721 _d188721 |
||