تعبیه ی هندسی درخت درنقاط داخل یک چندضلعی با حداقل تعداد خم

In this paper we consider to embed a tree T with N vertices on a set of N points inside a simple polygon on n vertices and the goal is to minimize the number of bends. The main idea of our algorithm is modeling the problem into graph matching problem and uses the graph matching algorithms. We apply the concept of error-correction transformation and find the appropriate cost function then we perform the graph matching with the minimum cost for minimizing the number of bends. The time complexity of the proposed algorithm is found to be O (N2n+N4).