Planarity Testing and Embedding

Planarity Testing and Embedding (2004)

Cached

Download Links

[www.cs.brown.edu]

by Pier Francesco Cortese , Maurizio Patrignani

Versions

Version History

Metadata Version 1

User correction supplied by mph

Datum	Value	Source
TITLE	Planarity Testing and Embedding	user correction
AUTHOR NAME	Pier Francesco Cortese	user correction
AUTHOR AFFIL	Universita ’ di Roma Tre	user correction
AUTHOR NAME	Maurizio Patrignani	user correction
AUTHOR AFFIL	Universita ’ di Roma Tre	user correction
ABSTRACT	Testing the planarity of a graph and possibly drawing it without intersections is one of the most fascinating and intriguing problems of the graph drawing and graph theory areas. Although the problem per se can be easily stated, and a complete characterization of planar graphs was available since 1930, an efficient solution to it was found only in the seventies of the last century. Planar graphs play an important role both in the graph theory and in the graph drawing areas. In fact, planar graphs have several interesting properties: for example they are sparse, four-colorable, allow a number of operations to be performed efficiently, and their structure can be elegantly described by an SPQR-tree (see Section 3.1.2). From the information visualization perspective, instead, as edge crossings turn out to be the main culprit for reducing readability, planar drawings of graphs are considered clear and comprehensible. As a matter of fact, the study of planarity has motivated much of the development of graph theory. In this chapter we review the number of alternative algorithms available in the literature for efficiently testing planarity and computing planar embeddings. Some of these algorithms	SVM HeaderParse 0.2
YEAR	2004	user correction
CITATIONS	25 found	ParsCit 1.0