Point-Set Embedding of Trees with Edge Constraints
نویسندگان
چکیده
Given a graph G with n vertices and a set S of n points in the plane, a point-set embedding of G on S is a planar drawing such that each vertex of G is mapped to a distinct point of S. A geometric point-set embedding is a point-set embedding with no edge bends. This paper studies the following problem: The input is a set S of n points, a planar graph G with n vertices, and a geometric point-set embedding of a subgraph G′ ⊂ G on a subset of S. The desired output is a point-set embedding of G on S that includes the given partial drawing of G′. We concentrate on trees and show how to compute the output in O(n log n) time and with at most 1+2 k/2 bends per edge, where k is the number of vertices of the given subdrawing. We also prove that there are instances of the problem which require at least k− 3 bends for some of the edges.
منابع مشابه
Edge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملOn trees and the multiplicative sum Zagreb index
For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...
متن کاملPlanarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-of-the-art planar drawing algorithms. However, many practical applications have additional constraints on the drawings that result in restrictions on the set of admissible planar embeddings. In this paper, we consider e...
متن کاملPlane 3-trees: Embeddability & Approximation
We give anO(n log n)-time linear-space algorithm that, given a plane 3-tree G with n vertices and a set S of n points in the plane, determines whether G has a point-set embedding on S (i.e., a planar straight-line drawing of G where each vertex is mapped to a distinct point of S), improving the O(n)-time O(n)-space algorithm of Moosa and Rahman. Given an arbitrary plane graph G and a point set ...
متن کاملTrees on Tracks
Simultaneous embedding of planar graphs is related to the problems of graph thickness and geometric thickness. Techniques for simultaneous embedding of cycles have been used to show that the degree-4 graphs have geometric thickness at most two [3]. Simultaneous embedding techniques are also useful in visualization of graphs that evolve through time. The notion of simultaneous embedding is relat...
متن کامل