Graph Drawing
Editat de Joe Marksen Limba Engleză Paperback – 10 ian 2001
Preț: 328.13 lei
Preț vechi: 410.16 lei
-20% Nou
Puncte Express: 492
Preț estimativ în valută:
58.06€ • 68.09$ • 50.99£
58.06€ • 68.09$ • 50.99£
Carte tipărită la comandă
Livrare economică 04-18 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540415541
ISBN-10: 3540415548
Pagini: 436
Ilustrații: XII, 422 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540415548
Pagini: 436
Ilustrații: XII, 422 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited 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.
Caracteristici
Includes supplementary material: sn.pub/extras