Two Algorithms for Finding Rectangular Duals of Planar Graphs (1992)
| Citations: | 10 - 3 self |
BibTeX
@INPROCEEDINGS{Kant92twoalgorithms,
author = {Goos Kant and Xin He},
title = {Two Algorithms for Finding Rectangular Duals of Planar Graphs},
booktitle = {},
year = {1992},
pages = {396--410},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present two linear-time algorithms for computing a regular edge labeling of 4-connected planar triangular graphs. This labeling is used to compute in linear time a rectangular dual of this class of planar graphs. The two algorithms are based on totally different frameworks, and both are conceptually simpler than the previous known algorithm and are of independent interests. The first algorithm is based on edge contraction. The second algorithm is based on the canonical ordering. This ordering can also be used to compute more compact visibility representations for this class of planar graphs.
