A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
From MaRDI portal
Publication:3824326
DOI10.1002/net.3230170306zbMath0672.05025OpenAlexW2121666768MaRDI QIDQ3824326
Sartaj K. Sahni, Jayaram Bhasker
Publication date: 1987
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230170306
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (16)
An efficient parallel algorithm for finding rectangular duals of plane triangular graphs ⋮ A linear algorithm to find a rectangular dual of a planar triangulated graph ⋮ Drawings of planar graphs with few slopes and segments ⋮ On rectangular cartograms ⋮ Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems ⋮ Improved floor-planning of graphs via adjacency-preserving transformations ⋮ Two algorithms for finding rectangular duals of planar graphs ⋮ Transformations among rectangular partitions ⋮ Unnamed Item ⋮ On triangulating planar graphs under the four-connectivity constraint ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ Simple and efficient floor-planning ⋮ On rectilinear duals for vertex-weighted plane graphs ⋮ ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME ⋮ Floorplanning by graph dualization: \(L\)-shaped modules ⋮ A theory of L-shaped floor-plans
Cites Work
This page was built for publication: A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
