A Numerical Optimization Approach to General Graph Drawing

A Numerical Optimization Approach to General Graph Drawing (1999)

by Daniel Tunkelang

Citations:

15 - 0 self

User correction supplied by mph

Datum	Value	Source
TITLE	A Numerical Optimization Approach to General Graph Drawing	user correction
AUTHOR NAME	Daniel Tunkelang	user correction
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	user correction
AUTHOR ADDR	Pittsburgh, PA 15213	user correction
ABSTRACT	Graphs are ubiquitous, finding applications in domains ranging from software engineering to computational biology. While graph theory and graph algorithms are some of the oldest, most studied fields in computer science, the problem of visualizing graphs is comparatively young. This problem, known as graph drawing, is that of transforming combinatorial graphs into geometric drawings for the purpose of visualization. Most published algorithms for drawing general graphs model the drawing problem with a physical analogy, representing a graph as a system of springs and other physical elements and then simulating the relaxation of this physical system. Solving the graph drawing problem involves both choosing a physical model and then using numerical optimization to simulate the physical system. In this	user correction
YEAR	1999	user correction
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Ph.D. Thesis	INFERENCE
CITATIONS	46 found	ParsCit 1.0