高级检索

    连接两个多边形成一条回路的算法

    ^AN ALGORITHM FOR JOINING TWO POLYGONS INTO A CIRCUIT

    • 摘要: 本文提出连接两个多边形成一条回路的算法,该算法需要O((n+m)log(n+m)·max(logn,logm))次比较和O((n+m)·max(logn,logm))次乘法。

       

      Abstract: An algorithm for joining two polygons into a circuit is presented in this paper. The algorithm requires O((n+m )log (n+m)· max (logn, logm) ) comparisons andO((n +m)· max (logn, logm) ) multiplications.

       

    /

    返回文章
    返回