Planar straight-line point-set embedding of trees with partial embeddings

Authors:
Alireza Bagheri;Mohammadreza Razzazi
Affiliations:
Department of Computer Engineering and IT, Amirkabir University of Technology, Tehran, Iran;Department of Computer Engineering and IT, Amirkabir University of Technology, Tehran, Iran
Venue:
Information Processing Letters
Year:
2010

Citing 6
Cited 0

Bipartite embedding of trees in the plane

Discrete Applied Mathematics
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
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
Drawing colored graphs on colored points

Theoretical Computer Science
Point-set embeddings of trees with given partial drawings

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given a set P of n points in the plane, an n-node tree T, and a partial embedding E of T on P (i.e. a planar straight-line point-set embedding of some sub-trees of T on a sub-set of P), we show that the problem of deciding whether there is a planar straight-line point-set embedding of T on P that includes E is NP-complete. This problem was posed as an open problem in E. Di Giacomo et al. (2009) [8].