simple intersection 中文意思是什麼

simple intersection 解釋
單式交叉
  • simple : adj （ pler; plest）1 單純的；簡單的，簡易的；輕便的。2 質仆的，自然的，天真的；樸素的；率直的，...
  • intersection : n. 1. 橫斷，橫切；交叉，相交。2. 【數學】交集。3. 交點，交叉線，十字路口。4. 邏輯乘法。
  1. A simple wave region should be so chosen as not to include points of intersection of wavelets.

    一個簡單波域必須選得合適，使它不包含子波的交點。
  2. 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的凸多邊形的求交演算法。
  3. We consider all kinds of plane line representations of a plane line, and a simple and practical line coordinate system is suggested. we also present a new 3 - d line representation model. the new representation model is based on the geometry theory : the intersection of two arbitrary planes in the 3 - d space is a line in a plane

    本文提出了直線坐標的概念，通過分析各種平面直線的表示方法，提出了一套簡單而實用的直線坐標表示方法，提出了一種新的空間三維直線表示法，這種表示空間三維直線方法是根據空間相交兩平面一般交於一條空間直線的思路而提出的。
  4. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  5. Put forward the idea of simple crossroads on the road intersection to solve the traffic block of intersection and give 2 examples

    針對城市交叉口的交通阻礙提出了十字路口簡易立交設計思想，並給出了2個實例。
分享友人
分享到 Line

分享到臉書