The Sacker- Sell problem in quasiperiodic case, whether quasiperiodic linear differential systems can be quasiperiodically triangulari2ed, is studied. A class of more concrete quasiperiodic linear differential systems...The Sacker- Sell problem in quasiperiodic case, whether quasiperiodic linear differential systems can be quasiperiodically triangulari2ed, is studied. A class of more concrete quasiperiodic linear differential systems which are not quasiperiodically triangularized are given under the stronger conditions: (i) the coefficient matrix is of C; (ii) the frequency satisfies the Diophantine condition. A sufficient condition for quasiperiodic triangularization of quasiperiodic linear differential systems is also established.展开更多
Graham 扫描在计算几何中是一种基本的后追踪技术.Graham 扫描三角形化简单多边形算法三角形化一个,1个顶点的简单多边形 P 的时间为 D(kn),k-1是多边形 P 的凹顶点数.在最坏的情况下,此算法为 O(n^2).其数据结构简单,运行速度快、极易...Graham 扫描在计算几何中是一种基本的后追踪技术.Graham 扫描三角形化简单多边形算法三角形化一个,1个顶点的简单多边形 P 的时间为 D(kn),k-1是多边形 P 的凹顶点数.在最坏的情况下,此算法为 O(n^2).其数据结构简单,运行速度快、极易应用.改进后的算法进一步简化了检测“耳朵”的步骤,使之更严谨、简明,并用 C 语言编程实现了改进后的算法.展开更多
文摘The Sacker- Sell problem in quasiperiodic case, whether quasiperiodic linear differential systems can be quasiperiodically triangulari2ed, is studied. A class of more concrete quasiperiodic linear differential systems which are not quasiperiodically triangularized are given under the stronger conditions: (i) the coefficient matrix is of C; (ii) the frequency satisfies the Diophantine condition. A sufficient condition for quasiperiodic triangularization of quasiperiodic linear differential systems is also established.
文摘Graham 扫描在计算几何中是一种基本的后追踪技术.Graham 扫描三角形化简单多边形算法三角形化一个,1个顶点的简单多边形 P 的时间为 D(kn),k-1是多边形 P 的凹顶点数.在最坏的情况下,此算法为 O(n^2).其数据结构简单,运行速度快、极易应用.改进后的算法进一步简化了检测“耳朵”的步骤,使之更严谨、简明,并用 C 语言编程实现了改进后的算法.
