多连通域的英文

• multiply connected region

• "多"英文翻译    many; much; more
• "连通"英文翻译    feed through; connection; co ...
• "域"英文翻译    land within certain boundari ...
• "连通域" 英文翻译 :    connected domain
• "n重连通域" 英文翻译 :    n tuply connected domain
• "单连通域" 英文翻译 :    simply connected domain; simplyconnected domain
• "复连通域" 英文翻译 :    complex connected domain; multiply connected domain
• "双连通域" 英文翻译 :    doubly-connected domain
• "重连通域" 英文翻译 :    tuply connected domain
• "多连通空间" 英文翻译 :    multiply connected space
• "多连通区" 英文翻译 :    multiply connected area
• "多连通区域" 英文翻译 :    multiply connected domain; multiply connected region
• "多连通体" 英文翻译 :    multiply connected body
• "多连通序列" 英文翻译 :    multiply connected sequence
• "多连" 英文翻译 :    dolen; doljan
• "连通" 英文翻译 :    feed through; connection; connected; intercommunication
• "奥多连" 英文翻译 :    odoljen
• "多连加" 英文翻译 :    dolenga
• "多连接" 英文翻译 :    multi-homed
• "多连科" 英文翻译 :    dolenko
• "多连体" 英文翻译 :    concatemer; concatenate
• "多连复段的" 英文翻译 :    riffy
• "多连杆式" 英文翻译 :    multilink; pasm
• "多连接支持" 英文翻译 :    multiple attachment support
• "多连切维奇" 英文翻译 :    doljancevic

• Using this method , the coupled fields for an elastic elliptical inhomogeneity with a screw dislocation under infinite longitudinal shear is examined
  这种分析方法，为求解复杂多连通域的平面弹性与热弹性问题提供了一条有效途径。
• A new analytical method for the plane elastic or thermoelastic problem on complex multiply connected region based upon the complex potential theory of elastic mechanics built by muskhelishvili . n . i . by combining the theory of sectionally holomorphic function , cauchy model integral , the analysis of the singularity of complex function and riemann boundary problem , the analysis relation between the complex potentials is obtained , and then the problem is transformed into solving an elementary complex potentials equation
  I弹性力学复势理论的基础上提出一种处理复杂多连通域平面弹性与热弹性问题新的分析方法，将复变函数的分区全纯函数理论，复势奇性分析， riemann边值问题与cauchy型积分相结合，求得各分区复势的解析关系，将问题归结为一个初等复势函数方程的求解。
• Cross section is a set of polygons and for this reason some relative algorithms for polygon are studied firstly . new algorithms for orientation and inclusion test for simple polygon are proposed . and ghosh ' s convex hull algorithms for simple polygon and convex polygons , subramanian ' s triangulation algorithm for arbitrary planar domain and o ' rourke ' s intersection algorithm for convex polygons are modified to make them more robust
  断层轮廓为简单多边形，首先对多边形的一些相关算法进行了研究，提出了一种判断简单多边形方向及点在多边形内外的新方法，改进了subramanian的平面多连通域的三角划分方法、 ghosh的多边形的凸包及多个多边形的凸包算法和o ' rourke的凸多边形的求交算法。