Point-set embeddings of plane 3-trees

Authors:
Rahnuma Islam Nishat;Debajyoti Mondal;Md. Saidur Rahman
Affiliations:
Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka - 1000, Bangladesh;Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka - 1000, Bangladesh;Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka - 1000, Bangladesh
Venue:
Computational Geometry: Theory and Applications
Year:
2012

Citing 7
Cited 5

Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Straight Line Embeddings of Planar Graphs on Point Sets

Proceedings of the 8th Canadian Conference on Computational Geometry
On embedding an outer-planar graph in a point set

Computational Geometry: Theory and Applications
Point-set embeddings of plane 3-trees

GD'10 Proceedings of the 18th international conference on Graph drawing
Improved algorithms for the point-set embeddability problem for plane 3-trees

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Embedding plane 3-trees in R2 and R3

GD'11 Proceedings of the 19th international conference on Graph Drawing

Universal line-sets for drawing planar 3-trees

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
On the hardness of point-set embeddability

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
The point-set embeddability problem for plane graphs

Proceedings of the twenty-eighth annual symposium on Computational geometry
Plane 3-trees: embeddability and approximation

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Universal point sets for planar three-trees

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

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 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(n^2) 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 @W(nlogn) lower bound on the time complexity for finding 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 kn points, and present a dynamic programming algorithm to find a point-set embedding of G on S if it exists. Furthermore, we show that the point-set embeddability problem for planar partial 3-trees is also NP-complete.