On embedding an outer-planar graph in a point set |
| |
Authors: | Prosenjit Bose |
| |
Institution: | School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada, K1S 5B6 |
| |
Abstract: | Given an n-vertex outer-planar graph G and a set P of n points in the plane, we present an O(nlog3n) time and O(n) space algorithm to compute a straight-line embedding of G in P, improving upon the algorithm in 8,12] that requires O(n2) time. Our algorithm is near-optimal as there is an Ω(nlogn) lower bound for the problem 4]. We present a simpler O(nd) time and O(n) space algorithm to compute a straight-line embedding of G in P where lognd2n is the length of the longest vertex disjoint path in the dual of G. Therefore, the time complexity of the simpler algorithm varies between O(nlogn) and O(n2) depending on the value of d. More efficient algorithms are presented for certain restricted cases. If the dual of G is a path, then an optimal Θ(nlogn) time algorithm is presented. If the given point set is in convex position then we show that O(n) time suffices. |
| |
Keywords: | Graph embedding Graph drawing Straight-line embedding |
本文献已被 ScienceDirect 等数据库收录! |
|