SUN Wenbin, ZHAO Xuesheng. Algorithm of Neighbor Finding on Sphere Triangular Meshes with Quaternary Code[J]. Geomatics and Information Science of Wuhan University, 2007, 32(4): 350-352.
Citation: SUN Wenbin, ZHAO Xuesheng. Algorithm of Neighbor Finding on Sphere Triangular Meshes with Quaternary Code[J]. Geomatics and Information Science of Wuhan University, 2007, 32(4): 350-352.

Algorithm of Neighbor Finding on Sphere Triangular Meshes with Quaternary Code

  • The characteristic of Quaternary codes is analyzed. The rule of distinguishing triangle direction is given out.The algorithm of neighbor finding from back to front with decomposing Quaternary code is presented.The analysis of time complexity between this decomposing algorithm and bartholdi's algorithm is approached.The result is that average consumed time of this decomposing algorithm is about 23.66% of Bartholdi's.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return