List of Articles به حداقل رساندن خم

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - تعبیه ی هندسی درخت درنقاط داخل یک چندضلعی با حداقل تعداد خم
  Hooman Tahayori
  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 More

  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). Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - Geometric embedding of the tree in points inside a polygon with minimum number of bends
  akram sepehri alireza bagheri
  In this article, we intend to embed a tree with N nodes on N points inside a polygon with n vertices. This embedding should be in such a way that the number of bends in the resulting tree is minimized. The main idea of ​​the new algorithm is to model the problem as a gr More

  In this article, we intend to embed a tree with N nodes on N points inside a polygon with n vertices. This embedding should be in such a way that the number of bends in the resulting tree is minimized. The main idea of ​​the new algorithm is to model the problem as a graph matching problem and use algorithms It is graph matching that leads to the examination of the link distance problem and the path with the minimum number of links, then by using the concept of error correction and finding a suitable cost function and using the graph analysis method, graph matching is done. We do it with minimal cost to minimize the number of bends and the algorithm has a computational complexity of O(N2n+N4). Manuscript profile