GRIP: Graph Drawing with Intelligent Placement

Pawel Gajer, Stephen G Kobourov

Research output: Contribution to journalArticle

46 Citations (Scopus)

Abstract

This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization. The algorithm underlying the system employs a simple recursive coarsening scheme. Rather than being placed at random, vertices are placed intelligently, several at a time, at locations close to their final positions. The running time and space complexity of the system are near linear. The implementation is in C using OpenGL for 3D viewing. The GRIP system allows for drawing graphs with tens of thousands of vertices in under one minute on a mid-range PC. To the best of the authors' knowledge, GRIP surpasses the fastest previous algorithms. However, speed is not achieved at the expense of quality as the resulting drawings are quite aesthetically pleasing.

Original languageEnglish (US)
Pages (from-to)203-224
Number of pages22
JournalJournal of Graph Algorithms and Applications
Volume6
Issue number3
StatePublished - 2002

Fingerprint

Graph Drawing
Placement
Coarsening
Function Minimization
OpenGL
Energy Minimization
Space Complexity
Energy Function
Fast Algorithm
Time Complexity
Graph in graph theory
Range of data

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications

Cite this

GRIP : Graph Drawing with Intelligent Placement. / Gajer, Pawel; Kobourov, Stephen G.

In: Journal of Graph Algorithms and Applications, Vol. 6, No. 3, 2002, p. 203-224.

Research output: Contribution to journalArticle

@article{81782618ce4a49088cafc10f26117ac0,
title = "GRIP: Graph Drawing with Intelligent Placement",
abstract = "This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization. The algorithm underlying the system employs a simple recursive coarsening scheme. Rather than being placed at random, vertices are placed intelligently, several at a time, at locations close to their final positions. The running time and space complexity of the system are near linear. The implementation is in C using OpenGL for 3D viewing. The GRIP system allows for drawing graphs with tens of thousands of vertices in under one minute on a mid-range PC. To the best of the authors' knowledge, GRIP surpasses the fastest previous algorithms. However, speed is not achieved at the expense of quality as the resulting drawings are quite aesthetically pleasing.",
author = "Pawel Gajer and Kobourov, {Stephen G}",
year = "2002",
language = "English (US)",
volume = "6",
pages = "203--224",
journal = "Journal of Graph Algorithms and Applications",
issn = "1526-1719",
publisher = "Brown University",
number = "3",

}

TY - JOUR

T1 - GRIP

T2 - Graph Drawing with Intelligent Placement

AU - Gajer, Pawel

AU - Kobourov, Stephen G

PY - 2002

Y1 - 2002

N2 - This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization. The algorithm underlying the system employs a simple recursive coarsening scheme. Rather than being placed at random, vertices are placed intelligently, several at a time, at locations close to their final positions. The running time and space complexity of the system are near linear. The implementation is in C using OpenGL for 3D viewing. The GRIP system allows for drawing graphs with tens of thousands of vertices in under one minute on a mid-range PC. To the best of the authors' knowledge, GRIP surpasses the fastest previous algorithms. However, speed is not achieved at the expense of quality as the resulting drawings are quite aesthetically pleasing.

AB - This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization. The algorithm underlying the system employs a simple recursive coarsening scheme. Rather than being placed at random, vertices are placed intelligently, several at a time, at locations close to their final positions. The running time and space complexity of the system are near linear. The implementation is in C using OpenGL for 3D viewing. The GRIP system allows for drawing graphs with tens of thousands of vertices in under one minute on a mid-range PC. To the best of the authors' knowledge, GRIP surpasses the fastest previous algorithms. However, speed is not achieved at the expense of quality as the resulting drawings are quite aesthetically pleasing.

UR - http://www.scopus.com/inward/record.url?scp=4043166921&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4043166921&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:4043166921

VL - 6

SP - 203

EP - 224

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 3

ER -