Mapping between 2-d meshes of the same size
Mapping Between 2-D Meshes of the Same Size

Given two 2-D meshesM 1 andM 2 of sizess i×ti wheres i≤ti (i=1,2) ands 1×t 1=s 2×t 2, embeddingM 1 toM 2 with minimum dilation is studied. First, several lower bounds on the dilations of embedding in different cases are presented. Then, an embedding algorithm with dilation s 1/s 2]+2 for the cases 1≤s 2 is proposed, which almost matches the lower bound s 1/s 2]. For the cases 1