Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

COMGEO

2012

ACM

2012

ACM

A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n points in the Euclidean plane, a point-set embedding of a plane graph G with n vertices on S is a straight-line drawing of G, where each vertex of G is mapped to a distinct point of S. The problem of deciding if G admits a point-set embedding on S is NP-complete in general and even when G is 2-connected and 2-outerplanar. In this paper, we give an O(n2 ) time algorithm to decide whether a plane 3-tree admits a point-set embedding on a given set of points or not, and ﬁnd an embedding if it exists. We prove an Ω(n log n) lower bound on the time complexity for ﬁnding a point-set embedding of a plane 3-tree. We then consider a variant of the problem, where we are given a plane 3-tree G with n vertices and a set S of k > n points, and present a dynamic programming algorithm to ﬁnd a point-set embedding of ...

Added |
20 Apr 2012 |

Updated |
20 Apr 2012 |

Type |
Journal |

Year |
2012 |

Where |
COMGEO |

Authors |
Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman |

Comments (0)