Straight line embeddings of rooted star forests in the plane
Discrete Applied Mathematics
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
Drawing planar 3-trees with given face-areas
GD'09 Proceedings of the 17th international conference on Graph Drawing
Drawing colored graphs on colored points
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Point-set embeddings of plane 3-trees
Computational Geometry: Theory and Applications
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
| Hi-index | 0.00 |
In the point set embeddability problem, we are given a plane graph G with n vertices and a point set S with n points. Now the goal is to answer the question whether there exists a straight-line drawing of G such that each vertex is represented as a distinct point of S as well as to provide an embedding if one does exist. Recently, in [15], a complete characterization for this problem on a special class of graphs known as the plane 3-trees was presented along with an efficient algorithm to solve the problem. In this paper, we use the same characterization to devise an improved algorithm for the same problem. Much of the efficiency we achieve comes from clever uses of the triangular range search technique.