Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees

@inproceedings{Moosa2011ImprovedAF,
  title={Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees},
  author={Tanaeem M. Moosa and Mohammad Sohel Rahman},
  booktitle={COCOON},
  year={2011}
}
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… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
7 Extracted Citations
17 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…