GD 2005 - PDF Preprint Papers

GD 2005 Graph Drawing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed GD-2005 Paper

click to vote

GD
2005
Springer

218views Computer Graphics» more GD 2005»

GEOMI: GEOmetry for Maximum Insight

13 years 10 months ago

Download www.it.usyd.edu.au

This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis meth...

Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	218	GEOMI: GEOmetry for Maximum Insight	claim
2	146	Applications of Parameterized st-Orientations in Graph Drawing Algorithms	claim
3	144	Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness	claim
4	137	D-Dupe: An Interactive Tool for Entity Resolution in Social Networks	claim
5	128	Visualizing Graphs as Trees: Plant a Seed and Watch it Grow	claim
6	122	Hierarchical Layouts of Directed Graphs in Three Dimensions	claim
7	121	C-Planarity of Extrovert Clustered Graphs	claim
8	121	Odd Crossing Number Is Not Crossing Number	claim
9	117	SDE: Graph Drawing Using Spectral Distance Embedding	claim
10	116	Drawing Clustered Graphs in Three Dimensions	claim
11	116	Incremental Connector Routing	claim
12	114	Drawing Kn in Three Dimensions with One Bend Per Edge	claim
13	107	Graph Treewidth and Geometric Thickness Parameters	claim
14	107	Energy-Based Clustering of Graphs with Nonuniform Degrees	claim
15	106	MultiPlane: A New Framework for Drawing Graphs in Three Dimensions	claim
16	105	Stress Majorization with Orthogonal Ordering Constraints	claim
17	104	A Mixed-Integer Program for Drawing High-Quality Metro Maps	claim
18	103	Dynamic Spectral Layout of Small Worlds	claim
19	102	On Straightening Low-Diameter Unit Trees	claim
20	97	Non-planar Core Reduction of Graphs	claim
21	94	Fast Node Overlap Removal	claim
22	91	Network Analysis and Visualisation	claim
23	87	On Balloon Drawings of Rooted Trees	claim
24	84	Crossing Number of Toroidal Graphs	claim
25	82	BLer: A Boundary Labeller for Technical Drawings	claim
26	81	Drawing Graphs Using Modular Decomposition	claim
27	79	A Hybrid Model for Drawing Dynamic and Evolving Graphs	claim
28	78	Delta-Confluent Drawings	claim
29	76	Transversal Structures on Triangulations, with Application to Straight-Line Drawing	claim
30	73	On Rectilinear Duals for Vertex-Weighted Plane Graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers