Abstract: By simplifying the complex issues, we analyses the division methods of rhomb grid and square grid in isomorphic networks.This paper proposes the division methods of heterometrous regular hexagon grid and heterometrous square grid, from the viewpoints of topology caculates the least number of nodes which are required to realize the seamless complete coverage using two grid direction method.The square grid has the superiority.Last, we point out heterometrous virtual square grid moving algorithm.Simulations prove the efficience of the algorithm.