| 000 | 05953nam a22006015i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-44541-8 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132547.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2001 gw | s |||| 0|eng d | ||
| 020 |
_a9783540445418 _9978-3-540-44541-8 |
||
| 024 | 7 |
_a10.1007/3-540-44541-2 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 072 | 7 |
_aUMB _2thema |
|
| 082 | 0 | 4 |
_a518.1 _223 |
| 245 | 1 | 0 |
_aGraph Drawing _h[electronic resource] : _b8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings / _cedited by Joe Marks. |
| 250 | _a1st ed. 2001. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2001. |
|
| 300 |
_aXII, 422 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 ; _v1984 |
|
| 505 | 0 | _aInvited Talk -- The Visual Representation of Information Structures -- Empirical Studies and Standards -- User Preference of Graph Layout Aesthetics: A UML Study -- A User Study in Similarity Measures for Graph Drawing -- Interactive Partitioning System Demonstration, Short -- An Experimental Comparison of Orthogonal Compaction Algorithms -- GraphXML — An XML-Based Graph Description Format -- Theory I -- On Polar Visibility Representations of Graphs -- A Linear Time Implementation of SPQR-Trees -- Labeling Points with Rectangles of Various Shapes -- How to Draw the Minimum Cuts of a Planar Graph -- Applications and Systems -- 2D-Structure Drawings of Similar Molecules -- Fast Layout Methods for Timetable Graphs -- An Algorithmic Framework for Visualizing Statecharts -- Visualization of the Autonomous Systems Interconnections with Hermes -- Drawing Hypergraphs in the Subset Standard (Short Demo Paper) -- Invited Talk -- Knowledge Discovery from Graphs -- Force-Directed Layout -- A Multilevel Algorithm for Force-Directed Graph Drawing -- A Fast Multi-scale Method for Drawing Large Graphs -- FADE: Graph Drawing, Clustering, and Visual Abstraction -- A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs -- GRIP: Graph dRawing with Intelligent Placement -- k-Level Graph Layout -- A Fast Layout Algorithm for k-Level Graphs -- Graph Layout for Displaying Data Structures -- k-Layer Straightline Crossing Minimization by Speeding Up Sifting -- Orthogonal Drawing I -- Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings -- Orthogonal Drawings of Cycles in 3D Space -- Three-Dimensional Orthogonal Graph Drawing with Optimal Volume -- Orthogonal Drawing II -- A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs -- Refinement ofThree-Dimensional Orthogonal Graph Drawings -- Theory II -- ?-Searchlight Obedient Graph Drawings -- Unavoidable Configurations in Complete Topological Graphs -- Minimum Weight Drawings of Maximal Triangulations -- A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band -- Symmetry and Incremental Layout -- An Algorithm for Finding Three Dimensional Symmetry in Trees -- On Maximum Symmetric Subgraphs -- Clan-Based Incremental Drawing -- The Marey Graph Animation Tool Demo -- Workshop and Contest -- Graph Data Format Workshop Report -- Graph-Drawing Contest Report. | |
| 520 | _aThis year’s meeting marked the Eighth International Symposium on Graph D- wing. The organizing and program committees worked hard to make this year’s symposium possible, and we were delighted that so many people came to - lonial Williamsburg, Virginia, for three days of the latest results in the eld of graph drawing. As in previous years, the review process was quite competitive. We accepted 30 out of 53 regular-length submissions, and 5 out of 15 short submissions, for a total acceptance ratio of 35 out of 68, or 51%. This year’s program featured several new developments in the eld. Four di erent approaches for handling very large graphs were presented in a session on force-directed layout. Two sessions were devoted to the latest advances in orthogonal graph drawing. And alongside the usual mix of theory and practice papers we had several contributions based on empirical studies of users and of systems. Our invited talks were given by two speakers who were new to most members of the GD community, but who work in areas that are closely related to graph drawing. Professor Colin Ware of the University of New Hampshire told us how knowledge of human visual perception is useful for the design of e ective data visualizations. And Professor David Jensen of the University of Massachusetts at Amherst talked about the process of knowledge discovery from graphs, a process that involves more than just graph drawing and visualization. | ||
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer graphics. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 1 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aDiscrete Mathematics. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aComputer Graphics. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 700 | 1 |
_aMarks, Joe. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540415541 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662208045 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1984 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-44541-2 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c189125 _d189125 |
||