planar graphs
rectangular duals
canonical ordering
labeling
representation
Two algorithms for finding rectangular duals of planar graphs
time
independent interest
chapter
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.
algorithm
triangular graph
first algorithm
en
2022-01-01T19:13
interest
edge contraction
edge labeling
chapters
396-410
dual
class
framework
more compact visibility representations
visibility representation
Compact Visibility Representation
1994
https://doi.org/10.1007/3-540-57899-4_69
second algorithm
planar triangular graphs
true
linear-time algorithm
graph
https://scigraph.springernature.com/explorer/license/
linear time
different frameworks
contraction
1994-01-01
regular edge labeling
ordering
Kant
Goos
Graph-Theoretic Concepts in Computer Science
978-3-540-48385-4
978-3-540-57899-4
He
Xin
Department of Computer Science, State University of New York at Buffalo, 14260, Buffalo, NY, USA
Department of Computer Science, State University of New York at Buffalo, 14260, Buffalo, NY, USA
doi
10.1007/3-540-57899-4_69
dimensions_id
pub.1018910920
Jan
Leeuwen
Information and Computing Sciences
Computation Theory and Mathematics
Springer Nature
Springer Nature - SN SciGraph project
Department of Computer Science, Utrecht University, Padualaan 14, 3584, CH Utrecht, the Netherlands
Department of Computer Science, Utrecht University, Padualaan 14, 3584, CH Utrecht, the Netherlands