Kant
Goos
Springer Berlin Heidelberg
Berlin, Heidelberg
1994
http://link.springer.com/10.1007/3-540-57899-4_69
1994-01-01
2019-04-15T14:10
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.
true
https://scigraph.springernature.com/explorer/license/
en
chapters
396-410
Two algorithms for finding rectangular duals of planar graphs
chapter
Xin
He
dimensions_id
pub.1018910920
Leeuwen
Jan
Springer Nature - SN SciGraph project
5a1ad271284d6be45f40e572f433555f3a0fd07da54314b243edbb9cc319fb47
readcube_id
978-3-540-48385-4
978-3-540-57899-4
Graph-Theoretic Concepts in Computer Science
10.1007/3-540-57899-4_69
doi
Department of Computer Science, Utrecht University, Padualaan 14, 3584 CH Utrecht, the Netherlands
Utrecht University
Information and Computing Sciences
Computation Theory and Mathematics
Department of Computer Science, State University of New York at Buffalo, 14260 Buffalo, NY, USA
University at Buffalo, State University of New York