Abstract
We present an efficient parallel algorithm for constructing rectangular duals of plane triangular graphs. This problem finds applications in VLSI design and floor-planning problems. No NC algorithm for solving this problem was previously known. The algorithm takesO(log2 n) time withO(n) processors on a CRCW PRAM, wheren is the number of vertices of the graph.
Similar content being viewed by others
References
K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A Simple Tree Contraction Algorithm,J. Algorithms,10 (1989), 287–302.
J. Bhasker and S. Sahni, A Linear Time Algorithm To Check for the Existence of a Rectangular Dual of a Planar Triangulated Graph,Networks,17 (1987), 307–317.
J. Bhasker and S. Sahni, A Linear Algorithm To Find a Rectangular Dual of a Planar Triangulated Graph,Algorithmica,3 (1988), 247–278.
G. Brebner and D. Buchanan, On Compiling Structural Descriptions to Floorplans,Proc. IEEE Internat. Conf. on Computer-Aided Design, 1983, pp. 6–7.
N. Chiba, T. Nishizeki, and N. Saito, A Linear 5-Coloring Algorithm of Planar Graphs,J. Algorithms,2 (1981), 317–327.
D. Coppersmith and S. Winograd, Matrix Multiplication via Arithmetic Progressions,Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 1–6.
N. Dadoun and D. G. Kirkpatrick, Parallel Processing for Efficient Subdivision Search,Proc. ACM Symp. on Computational Geometry, 1987, pp. 205–214.
P. Eades and R. Tamassia, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Technical Report CS-89-09, Department of Computer Science, Brown University, 1989.
M. Fürer, X. He, M.-Y, Kao, and B. Raghavachari, O(n, log logn)-Work Parallel Algorithms for Straight-Line Grid Embedding of Planar Graphs,Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, 1992, pp. 410–419.
H. Gazit and G. L. Miller, An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph,Inform. Process. Lett.,28 (1988), 61–65.
A. V. Goldberg, S. A. Plotkin, and G. E. Shanon, Parallel Symmetry Breaking in Sparse Graphs,Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 315–324.
T. Hagerup, M. Chrobak, and K. Diks, Optimal Parallel 5-Coloring of Planar Graphs,SIAM J. Comput.,18(2), (1989), 288–300.
X. He, On Finding the Rectangular Duals of Planar Triangulated Graphs,SIAM J. Comput.,22(6) (1993), 1218–1226.
X. He, Efficient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs,Algorithmica,5 (1990), 545–559.
W. R. Heller, G. Sorkin, and K. Maling, The Planar Package Planner for System Designers,Proc. 19th Design Automation Conference, 1982, pp. 253–260.
M. Y. Hsueh, Symbolic Layout and Compaction of Integrated Circuits, Ph.D. Thesis, University of California, Berkeley, 1979, pp. 26–28 and 46–52.
M. Y. Hsueh and D. O. Pederson, Computer-Aided Layout of LSI Circuit Building-Blocks,Proc. IEEE Internat. Symp. on Circuits and Systems, 1979, pp. 474–477.
J. Ja'Ja' and J. Simon, Parallel Algorithms in Graph Theory: Planarity TestingSIAM J. Comput.,11(2) (1982), 314–328.
G. R. Kampen, Orienting Planar Graphs,Discrete Math.,14 (1976), 337–341.
D. G. Kirkpatrick, Optimal Search in Planar Subdivisions,SIAM J. Comput.,12(1) (1983), 28–35.
K. Koźmiński and E. Kinnen, Rectangular Dual of Planar Graphs,Network,5 (1985), 145–157.
K. Maling, S. H. Mueller, and W. R. Heller, On Finding Most Optimal Rectangular Package Plans,Proc. 19th Design Automation Conference, 1982, pp. 663–670.
V. Ramachandran and J. Reif, An Optimal Parallel Algorithm for Graph Planarity,Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 282–287.
P. Rosentiehl and R. E. Tarjan, Rectilinear Planar Layouts of Planar Graphs and Bipolar Orientations,Discrete Comput. Geom.,1(4) (1986), 343–353.
R. Tamassia, On Embedding a Graph in the Grid with the Minimum Number of Bends,SIAM J. Comput.,16(3) (1987), 421–444.
R. Tamassia and I. G. Tollis, A Unified Approach to Visibility Representation of Planar Graphs,Discrete Comput. Geom.,1(4) (1986), 321–341.
R. Tamassia and I. G. Tollis, Planar Grid Embedding in Linear Time,IEEE Trans. Circuits and Systems,36(9) (1989), 1230–1234.
R. Tamassia and I. G. Tollis, Tessellation Representations of Planar Graphs,Proc. 27th Annual Allerton Conf., (1989), pp. 48–57.
R. Tamassia, I. G. Tollis, and J. S. Vitter, Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings,Proc. IEEE Symp. on Parallel and Distributed Processing, 1991, pp. 386–393.
R. Tamassia and J. S. Vitter, Parallel Transitive Closure and Point Location in Planar Structures,SIAM J. Comput.,20(4) (1991), 708–725.
K. Zilbert and R. Saal, On Computer-Aided Hybrid Circuit Layout,Proc. IEEE Internat. Symp. on Circuits and Systems, 1974, pp. 314–318.
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Wong.
This research was supported by NSF Grants CCR-9011214 and CCR-9205982.
Rights and permissions
About this article
Cite this article
He, X. An efficient parallel algorithm for finding rectangular duals of plane triangular graphs. Algorithmica 13, 553–572 (1995). https://doi.org/10.1007/BF01189069
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01189069