List of Articles تعبیه¬ی درخت در مجموعه نقاط

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - 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