Computing the Map of Geometric Minimal Cuts
- 262 Downloads
In this paper we consider the following problem of computing a map of geometric minimal cuts (called MGMC problem): Given a graph G=(V,E) and a planar rectilinear embedding of a subgraph H=(V H ,E H ) of G, compute the map of geometric minimal cuts induced by axis-aligned rectangles in the embedding plane. The MGMC problem is motivated by the critical area extraction problem in VLSI designs and finds applications in several other fields. In this paper, we propose a novel approach based on a mix of geometric and graph algorithm techniques for the MGMC problem. Our approach first shows that unlike the classic min-cut problem on graphs, the number of all rectilinear geometric minimal cuts is bounded by a low polynomial, O(n 3). Our algorithm for identifying geometric minimal cuts runs in O(n 3logn(loglogn)3) expected time which can be reduced to O(nlogn(loglogn)3) when the maximum size of the cut is bounded by a constant, where n=|V H |. Once geometric minimal cuts are identified we show that the problem can be reduced to computing the L ∞ Hausdorff Voronoi diagram of axis aligned rectangles. We present the first output-sensitive algorithm to compute this diagram which runs in O((N+K)log2 NloglogN) time and O(Nlog2 N) space, where N is the number of rectangles and K is the complexity of the Hausdorff Voronoi diagram. Our approach settles several open problems regarding the MGMC problem.
KeywordsGeometric minimal cut Hausdorff Voronoi diagram Output sensitive algorithm Plane sweep algorithm Computational geometry
The authors would like to thank three anonymous referees for their thoughtful comments and suggestions which significantly improve the presentation of the paper.
- 3.Dehne, F., Maheshwari, A., Taylor, R.: A coarse grained parallel algorithm for Hausdorff Voronoi diagrams. In: Proc. 2006 International Conference on Parallel Processing, pp. 497–504 (2006) Google Scholar
- 4.Driscoll, J.R., Sarnak, N., Sleator, D., Tarjan, R.: Making data structures persistent. In: Proceedings of the 18th annual ACM symposium on Theory of computing, pp. 109–121 (1986) Google Scholar
- 10.Henzinger, M.R., King, V.: Randomized dynamic graph algorithms with polylogarithmic time per operation. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 519–527 (1995) Google Scholar
- 20.Papadopoulou, E.: Higher order Voronoi diagrams of segments for VLSI critical area extraction. In: ISAAC’07. LNCS, vol. 4835, pp. 716–727 (2007) Google Scholar
- 25.Papadopoulou, E., Xu, J.: The L ∞ Hausdorff Voronoi diagram revisited. In: IEEE-CS Proceedings of Int. Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2011 (2011) Google Scholar
- 26.Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: STOC’00, pp. 343–350 (2000) Google Scholar