Picture 1 of 1

Stock photo

Graph Drawing : 8th International Symposium Gd 2000, Colonial Williamsburg, ... - Picture 1 of 1

Lecture Notes in Computer Science Ser.: Graph Drawing : 8th International Symposium GD 2000, Colonial Williamsburg, VA, USA, September 2000 - Proceedings by Symposium on Graph Drawing Staff (2001, Trade Paperback)

Great Book Prices Store (347859)

97.3% positive Feedback

Price:

US $96.14

Approximately£71.74

+ $19.99 postage

Estimated delivery Tue, 7 Oct - Tue, 28 Oct

Returns:

No returns, but backed by the eBay Money Back Guarantee.

Condition:

New

About this product

Product Identifiers

PublisherSpringer Berlin / Heidelberg

ISBN-103540415548

ISBN-139783540415541

eBay Product ID (ePID)1854378

Product Key Features

Number of PagesXii, 422 Pages

Publication NameGraph Drawing : 8th International Symposium GD 2000, Colonial Williamsburg, VA, USA, September 2000 - Proceedings

LanguageEnglish

SubjectComputer Graphics, Programming / Algorithms, Computer Science, Graphic Methods, Discrete Mathematics

Publication Year2001

TypeTextbook

Subject AreaMathematics, Computers

AuthorSymposium on Graph Drawing Staff

SeriesLecture Notes in Computer Science Ser.

FormatTrade Paperback

Dimensions

Item Weight47.3 Oz

Item Length9.2 in

Item Width6.1 in

Additional Product Features

Intended AudienceScholarly & Professional

LCCN00-054759

Dewey Edition21

Series Volume Number1984

Number of Volumes1 vol.

IllustratedYes

Dewey Decimal511/.5

Table Of ContentInvited 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.

SynopsisThis 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.

LC Classification NumberQA76.9.A43