Schnyder Decompositions for Regular Plane Graphs and Application to Drawing

Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we generalize the definition of Schnyder woods to d -angulations (plane graphs with faces of degree d ) for all d ≥3. A Schnyder decomposition is...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 62; no. 3-4; pp. 1159 - 1197
Main Authors:	Bernardi, Olivier, Fusy, Éric
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.04.2012 Springer Springer Verlag
Subjects:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Discrete Mathematics Exact sciences and technology Flows in networks. Combinatorial problems Graph theory Information retrieval. Graph Mathematics Mathematics of Computing Operational research and scientific management Operational research. Management science Sciences and techniques of general use Theoretical computing Theory of Computation Straight-line drawing Orthogonal drawing 4-regular map Schnyder woods Forest decomposition Nash-Williams theorem Schnyder labelling Nash strategy Costs Forests Tree(graph) Grid Decomposition method Labelling Duality Compaction Graphism Graph drawing Quadrangulation Partition Triangulation Probabilistic approach Permutation Disjoint edge Graph theory Orientation Game theory Computational geometry Truss structure Treeing Spanning tree Data visualization Graph degree Wire frame model Graphic method Regular graph
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!