adjacent points 中文意思是什麼
-
As it can be expressed easily by argument equations, we use the conicoid as the criteria of points " classification. based on the point ' s normal and the adjacent field, corresponding to the conicoid equation such as plane, ball and cylinder, we search the points that fit the equation along the adjacent field. using this method, we realized the automatic classification of unorganized points
本文採用了可以比較方便地用參數方程表示的二次曲面作為數據點的分類標準，根據點的法向量以及其鄰域結點的各種屬性，對應于平面、球面、柱面等二次曲面，依據曲面方程的特點，從起始點開始沿鄰域深度優先遞歸尋找符合方程的數據點，實現了散亂數據點的自動分類。 -
We use a size changeable adjacent field to describe the topological structure of 3d unorganized points in our algorithm. it can offer essential dynamic information for tessellation and points " normal
演算法採用可以控制大小的鄰域作為空間散亂數據點的拓撲關系的幾何描述，為網格劃分和點的法向量的幾何描述提供了必要的動態幾何信息。 -
This paper is concerned with, the existence and stability of travelling wave solutions for the viscous balance law which is an extension of viscous conservation law where a reaction term g ( u ) is added. l ) the existence of travelling wave solutions by geometric singular perturbation method, we investigate the existence of travelling waves ( a2 ) connecting a saddle point and a sink point and the existence of viscous shock waves c connecting two adjacent or disadjacent saddle points. by giving a detailed analysis of the fast and slow manifolds and verifying the transversality of the intersection of singular stable and unstable manifolds of the reduced problem along the singular heteroclinic orbit, we obtain the existence of travelling waves ( a2 ) in the case of a convex flow function / and that of viscous shock waves c under the assumption that f " is bounded
主要結果如下： 1 ）行波的存在性本文利用[ 37 ]中幾何奇異攝動理論，通過仔細分析= 0時的快流、慢流，驗證= 0時慢流方程的穩定與不穩定流形橫截相交於奇異異宿軌道，先在f為凸的條件下嚴格證明了（ ）存在連接不相鄰的鞍點、結點的行波（ a2 ） ；然後在地f有界的條件下得到（ ）存在連接鞍點（包括相鄰和不相鄰）的粘性沖擊波c ，彌補了[ 11 ]缺少嚴格證明的不足，並推廣了[ 11 ]在f為凸的條件下得到的粘性沖擊波的存在性結果。 -
On the background of selecting an optimal combination of elastic pads " height between the two adjacent cylinders, which carry out the design requirement of combinative cylinders assembled structure, in this dissertation, the optimal design model is established ground on geometrical and mechanical model of the combinative cylinders assembled structure. the algorithm that integrates multi - objective ' s decision - making method with minimal distance between two points in euclid ' s space into the modified genetic algorithm to solute the optimal model is presented
本文以選取層間彈性墊層厚度實現組合圓筒裱糊裝配結構的設計要求為研究背景，依據組合圓筒裱糊裝配結構的幾何模型與力學模型，建立組合圓筒裱糊裝配結構的優化模型，提出改進遺傳演算法與歐幾里德空間最短距離準則的多目標決策方法相結合的優化演算法。 -
In the mesh the local geometric and topological property can be clearly described with its adjacent points for a given point. then the delaunay triangulation technique in two dimensions is used to delete and modify the illegal triangles in the resulting mesh
本文採用切平面作為曲面的局部近似，將局部的采樣點投影到切平面上，並對投影點集作二維delaunay三角剖分，最後根據投影點上的鄰接關系確定三維點之間的連接關系。 -
This dissertation proposes an algorithm to solve the problem by constructing transition contours using active contour model. the algorithm considers the transition contours construction as a growing process, so it is based on higher layer knowlege and can ensure that transition contours are similar to trunk contours and branch contours, and also reconstructed transition surfaces at branch points are smooth. the contours are connected using adjacent contours synchronous marching algorithm
採用基於全局的柱體生長法來判斷斷層間輪廓的相互對應關系；針對輪廓線表面重建中的難點問題?分叉問題，提出了一種基於主動輪廓模型的過渡輪廓構造方法，這種方法從物體主動生長這一角度出發考慮過渡輪廓的構造，能夠產生綜合兩斷層上輪廓特徵的過渡輪廓，是一種基於全局性高層信息的有效輪廓構造演算法；利用相鄰輪廓線同步前進法進行輪廓拼接。 -
Without using a model whose topology is known for mesh fitting, the algorithm simplifies the 3d surface topology problem to 2d surface topology problem by projection. then the best 3d surface topology is deduced using the minimum summing of spans criterion based on the " minimum offset " criterion which is proposed in this paper to determining the points links between two adjacent contours. the custom software is designed for 3d rendering using opengl interface
為解決不平行輪廓的重建問題，本文用投影的方法把三維表面拓撲結構問題轉化為二維表面拓撲結構問題；為確定平面輪廓間點的對應關系，本文提出基於最小偏移量準則的輪廓拼接演算法並用跨段之和最小準則來確定輪廓拼接的起始點和最佳可接受的表面，從而確定三維表面的拓撲結構。 -
The dividing process is recorded by octree, and then we make out the rapid adjacent - field searching algorithm using envelopment - box ' s recursion feature. this algorithm can also kick off some noise - points from the data cloud. it make the consequent process of surface reconstruction more convenience and precise
分割過程採用八叉樹來記錄，並利用包圍盒的遞歸特性實現了點的鄰域的快速搜索演算法，同時可以有效地排除噪聲點，顯著減少了密集散亂數據點雲幾何建模所花費的時間，提高了建模效率。 -
In addition, by phase plane method we obtain the existence of travelling fronts ( al ) connecting two adjacent equilibria under the assumptions that f " is bounded and that of viscous shock waves c connecting two adjacent saddle points with / a convex function
另外，利用經典的相平面分析法，本文證明了（ ）在f有界時存在連接相鄰平衡點的波前（ a1 ）及在f為凸時存在連接相鄰鞍點的粘性沖擊波c 。 -
For the detecting and tracking of objects in a static background, we summarize mature detecting algorithms, compare the adjacent frame difference method with the adaptive background difference one and implement an automatic object detecting and tracking system based on adaptive background difference and kalman filtration. as for image feature extraction, we systematically summarize available extraction methods and present the definition of image feature points
靜止背景中目標檢測和跟蹤方面，本文在前人大量工作的基礎上，總結了成熟的靜止背景中目標檢測演算法，試驗對比了瞬時差分法和自適應背景相減法，提出並實現了一個基於自適應背景相減法和卡爾曼濾波的自動目標檢測和跟蹤系統。 -
At the end of each turn, if this unit is adjacent to an island on your opponent ' s side of the map, you may remove one this unit from the game and score 6 victory points. you can only remove one unit with vital cargo from the game per turn
任何一輪結束時，如果這個單位是在你敵人一側地圖的島嶼上，你可以移除這個單位並獲得6個勝利點，每局游戲你只可以移除一組重要貨物。 -
The algorithm, which uses the distance relation of the nodes in the traffic network, can search information of trips, between given od points and trips which intersect groups of respective adjacent points of od points, and can analyze, evaluate, and filter these information in the light of characteristic of carpool path so that the carpool formation is convenient for ride matching
該演算法利用交通路網中各結點間的距離關系，可以檢索給定起迄點間及起迄點各自鄰近結點群之間存在的出行信息，並能根據合乘出行路徑特點對檢索出的信息進行分析、評價和優選，以方便出行者進行合乘組織。 -
On the base of determination of corresponding points between adjacent sections, dissimilar segments are separated to construct spatial dissimilar polygons. then triangular mesh interpolating the cross sections are obtained by tiling the dissimilar polygons and similar segments
在確定相鄰層輪廓對應點的基礎上，將不相似部分分離出來並跟蹤不相似部分構成不相似多邊形，然後分別對相似部分和不相似部分進行三角化，得到三角網格模型。 -
Clinical observations on the treatment of vertebroarterial cervical spondylopathy by selection of compatible adjacent and distant points
齊刺治療椎動脈型頸椎病的臨床觀察 -
We construct the algorithm of three - dimensions model surface reconstruction in three stages : first, we use oct - tree to describe scatter data points in space, second find adjacent points and tangent plane and use the triangulation method to realize 3d surface reconstruction in the end, in research on algorithm of three dimensions model surface reconstruction based on scatter data points
在「基於散亂數據三維表面演算法的研究」這一章中，首先通過八叉樹的數據結構的演算法對三維散亂數據進行處理，然後再確定鄰點和微切平面，最後用三角網格化的方法完成三維物體表面重構。 -
Then based on the idea of predictive motion vector, using of spatial correlation of adjacent block and global minimum points probability distribution characteristic, predictive diamond searching ( pds ) and its advanced mode : adaptive pds ( apds ) are introduced. finally the algorithm of pds and apds and its simulation results comparing with conventional me algorithm are given
然後基於預測性運動矢量的概念，利用相鄰塊運動矢量的相關性和全局極值點概率分佈特性，提出了預測性菱形搜索演算法和它的改進演算法：自適應預測性菱形搜索法，設計出具體演算法，並給出了與傳統快速塊匹配法比較的計算機模擬結果。 -
On the proving ground, the extracted feature points contain the precise displacement between two adjacent frames, thus form a credible basis for the image stabilization
測試用例表明，該方法檢測到的特徵點能代表兩幀圖像間的運動情況，從而為圖像穩定提供了可靠的基礎。 -
As to the problem that plane ' s normal has two opposite direction, we using " direction spread " to resolve it. examination result show that adopting adjacent points " main normal direction as current point ' s normal direction can resolve that problem and provide reliable information to points " classification
對於法向量存在兩個相反方向的問題，本文使用了「方向傳播」的方法，由鄰域中法向量的主流方向確定待求點的法向量方向，實驗結果表明可以較好地解決法向量方向不統一的問題，為后續的數據點分類提供可靠依據。 -
On the basis of the aforementioned approaches, the conceptual city height profile on both sides of victoria harbour with reference to the seven possible vantage points is shown in the adjacent figure
在構思中的城市高度輪廓左圖顯示根據上文所述的取向，在構思中從七個擬議瞭望點可見的維港兩岸城市高度輪廓。 -
The name is therefore given to supply chain since all the adjacent points ( enterprise ) over the wide network have a kind of supply and demand relationship
由於這一網路上的相鄰節點（企業）都是一種供應與需求關系，因此稱之為供應鏈。
分享友人