A linear algorithm to find a rectangular dual of a planar triangulated graph
From MaRDI portal
Publication:1097704
DOI10.1007/BF01762117zbMath0635.68074OpenAlexW2998789653WikidataQ56059583 ScholiaQ56059583MaRDI QIDQ1097704
Jayaram Bhasker, Sartaj K. Sahni
Publication date: 1988
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01762117
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Planar L-Drawings of Bimodal Graphs ⋮ An efficient parallel algorithm for finding rectangular duals of plane triangular graphs ⋮ Drawings of planar graphs with few slopes and segments ⋮ Drawing planar graphs using the canonical ordering ⋮ Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems ⋮ Rectangular grid drawings of plane graphs ⋮ Planar Confluent Orthogonal Drawings of 4-Modal Digraphs ⋮ Improved floor-planning of graphs via adjacency-preserving transformations ⋮ Planar confluent orthogonal drawings of 4-modal digraphs ⋮ An annotated review on graph drawing and its applications ⋮ Two algorithms for finding rectangular duals of planar graphs ⋮ Dynamic maintenance of planar digraphs, with applications ⋮ Transformations among rectangular partitions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A theory of rectangular dual graphs ⋮ Realization and connectivity of the graphs of origami flat foldings ⋮ Rectangular grid drawings of plane graphs ⋮ Rectangular-radial drawings of cubic plane graphs ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ Rectangular drawings of plane graphs without designated corners ⋮ Simple and efficient floor-planning ⋮ INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS ⋮ Planar L-Drawings of Bimodal Graphs ⋮ Floorplanning by graph dualization: \(L\)-shaped modules ⋮ A theory of L-shaped floor-plans
Cites Work
