International Symposium on Graph Drawing

GD 2010: Graph Drawing pp 317-328

Point-Set Embeddings of Plane 3-Trees

(Extended Abstract)
  • Rahnuma Islam Nishat
  • Debajyoti Mondal
  • Md. Saidur Rahman
Conference paper

DOI: 10.1007/978-3-642-18469-7_29

Volume 6502 of the book series Lecture Notes in Computer Science (LNCS)

Abstract

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 on 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(n2logn) time algorithm to decide whether a plane 3-tree admits a point-set embedding on a given set of points or not, and find an embedding if it exists. We prove an Ω(n logn) lower bound on the time complexity for finding a point-set embedding of a plane 3-tree. Moreover, we 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 give a polynomial time algorithm to find a point-set embedding of G on S if it exists.

Keywords

Point-set embeddingPlane 3-treeLower bound
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Rahnuma Islam Nishat
    • 1
  • Debajyoti Mondal
    • 1
  • Md. Saidur Rahman
    • 1
  1. 1.Graph Drawing and Information Visualization Laboratory, Department of Computer Science and EngineeringBangladesh University of Engineering and Technology (BUET)DhakaBangladesh