A programming project: trimming the spring algorithm for drawing hypergraphs

Authors:
Harri Klemetti;Ismo Lapinleimu;Erkki Mäkinen;Mika Sieranta
Affiliations:
University of Tampere, Department of Computer Science P.O. Box 607, FIN-33101 Tampere, Finland;University of Tampere, Department of Computer Science P.O. Box 607, FIN-33101 Tampere, Finland;University of Tampere, Department of Computer Science P.O. Box 607, FIN-33101 Tampere, Finland;University of Tampere, Department of Computer Science P.O. Box 607, FIN-33101 Tampere, Finland
Venue:
ACM SIGCSE Bulletin
Year:
1995

Citing 4
Cited 3

An algorithm for drawing general undirected graphs

Information Processing Letters
Graph drawing by force-directed placement

Software—Practice & Experience
A method for drawing graphs

SCG '85 Proceedings of the first annual symposium on Computational geometry
Graphs and Hypergraphs

Graphs and Hypergraphs

Genetic programming applied to Othello: introducing students to machine learning research

SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Drawing Hypergraphs in the Subset Standard (Short Demo Paper)

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Algorithms for the hypergraph and the minor crossing number problems

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph drawing problems provide excellent material for programming projects. As an example, this paper describes the results of an undergraduate project which dealt with hypergraph drawing. We introduce a practical method for drawing hypergraphs. The method is based on the spring algorithm, a well-known method for drawing normal graphs.