A linear algorithm to find a rectangular dual of a planar triangulated graph

@article{Bhasker1986ALA,
  title={A linear algorithm to find a rectangular dual of a planar triangulated graph},
  author={J. Bhasker and S. Sahni},
  journal={Algorithmica},
  year={1986},
  volume={3},
  pages={247-278}
}
We develop anO(n) algorithm to construct a rectangular dual of ann-vertex planar triangulated graph. 
115 Citations
On Finding the Rectangular Duals of Planar Triangular Graphs
  • Xin He
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1993
  • 83
  • Highly Influenced
  • PDF
An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
  • Xin He
  • Computer Science, Mathematics
  • Algorithmica
  • 2005
  • 2
Embedding plane graphs in the grids
  • Ibrahim Cahit, H. Kheddouci
  • Mathematics, Computer Science
  • Ninth International Conference on Information Visualisation (IV'05)
  • 2005
Regular labelings and geometric structures
  • 11
  • PDF
Planar orthogonal drawings of graphs
  • R. Tamassia
  • Mathematics
  • IEEE International Symposium on Circuits and Systems
  • 1990
  • 19
Two Algorithms for Finding Rectangular Duals of Planar Graphs
  • G. Kant, Xin He
  • Mathematics, Computer Science
  • WG
  • 1993
  • 51
  • PDF
E cient Parallel Algorithms for Two Graph Layout Problems
  • Xin He
  • 1991
  • 4
  • Highly Influenced
Rectangular Drawings of Planar Graphs
  • 19
  • PDF
On Touching Triangle Graphs
  • 29
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits
  • 85
  • Highly Influential
A linear algorithm to check for the existence of a rectangular dual of a planar triangulated
  • graph, Networks,
  • 1987