GRIP: Graph Drawing with Intelligent Placement

Pawel Gajer, Stephen G. Kobourov

Research output: Contribution to journalArticlepeer-review

52 Scopus citations


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
Issue number3
StatePublished - 2002

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics


Dive into the research topics of 'GRIP: Graph Drawing with Intelligent Placement'. Together they form a unique fingerprint.

Cite this