點的鄰域 的英文怎麼說
中文拼音 [diǎndelīnyù]
點的鄰域
英文
neighborhood of a point-
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
本文採用了可以比較方便地用參數方程表示的二次曲面作為數據點的分類標準,根據點的法向量以及其鄰域結點的各種屬性,對應于平面、球面、柱面等二次曲面,依據曲面方程的特點,從起始點開始沿鄰域深度優先遞歸尋找符合方程的數據點,實現了散亂數據點的自動分類。Then, the associated search optimal algorithm based on virtual avl tree is promoted to rapidly reconstruct the half - edge topological structure. 3. to rebuild the tooth surface from the littery measure data, the membrane deformation algorithm based on loop subdivision is given to fit density triangle meshes to subdivision surface
前者巧妙、高效地完成了去除冗餘點的工作,將stl數據的存儲尺寸壓縮為原來的18 % 25 % ;後者完成了數據的半邊拓撲重建,使得后續對于邊界邊搜索、 1環鄰域搜索顯示出較好的優勢,實現了三角網格模型的快速拓撲重建。In the process of processing image, image ' s vision effect is improved by some image enhance technique such as neighboring region average and pixel expanding. in accord with the feathers of the soil microphotograph, a three - level segmentation scheme is used to segment the soil microphotograph
在圖像處理過程中,對圖像進行了增強處理改善圖像視覺效果,採用了諸如灰度變換、改進的鄰域平均法和像素點擴張法改善圖像對比度以及消除圖像中的噪聲。A real rough set space and the concepts of real lower and upper approximation corresponding to real - valued attributes is studied. a rhombus neighborhood for som is proposed, and the combination of som and rough sets theory is explored in the dissertation. according to the distance between the weight of winner node and the input vector in the real rough sets space, some new weights learning rules are defined
本文提出採用菱形鄰域代替一般的方形鄰域,可以減少待修正權重的數目;並利用實數粗糙空間的下、上近似集的精確概念劃分自組織映射的輸出結果,使得改進后的映射結果中各類樣本點之間有明顯的間隔,易於進行分類識別。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
演算法採用可以控制大小的鄰域作為空間散亂數據點的拓撲關系的幾何描述,為網格劃分和點的法向量的幾何描述提供了必要的動態幾何信息。In this paper, we first reconstruct a second order polynomial surface to approximate the original point model in the local area of each point, which is then restricted within a so - called - confidence region, producing a - surfel
摘要在每個點附近重建一個二次多項式函數曲面逼近原點模型,並根據逼近誤差將每個重建曲面限制在稱為置信鄰域的范圍內,從而形成一個面元。A normal transform is introduced, and there are enough much grids in the region between the critical layer and the wall, where the variation of the disturbance is the quickest. the finite - difference of governing equations with fourth - order accuracy in the normal direction is utilized in full regions including points close the wall, and is very important for accurately discreting equations. the combination of global and local methods is implemented, and a new iterative formula is derived
對于曲線坐標系下的拋物化穩定性方程,文中發展了求解的高效數值方法:引進法向變換,使得在臨界層與壁面之間的擾動量變化最快的區域有更多的法向網格點;導出包含邊界鄰域在內的完全四階精度的法向有限差分格式,這對方程精確離散至關重要;採用全局法和局部法相結合的方法及其新的迭代公式,大大加速收斂並得到更精確的特徵值。It is based on mpf, which treats inequality constraints with a modified penalty term. the mpf method alternatively minimizes the mpf and updates the lagrange multipliers. the mpf method avoids the in - differentiability of the max { x, 0 }
修改的罰函數法所用的罰函數消除了經典罰函數的主要缺點,修改的罰函數存在解,且在解的鄰域內保持目標函數和約束函數的光滑性。In this algorithm, the sharp features on a mesh model are located through analysis of quadric error matrixes of super - neighbor of vertices on the model, so that these features can be preserved during mesh simplification
通過分析網格模型中頂點超鄰域的二次誤差矩陣,對模型上的重要細節特徵進行定位,實現了網格簡化過程中細節特徵的保持。A pulse hard source has been adjusted to allow the reflection wave pass by the source without retroreflection. and the calculation area is changeable at the different time step, so only those area with wave propagation have been calculated. as the results, the total calculation time can be reduced
還有計算區域隨時間改變的方法,利用fdtd計算空間點的鄰近性,在不同的時間步上計算不同大小的區域,使得只有波傳播到的區域被計算,這樣可以縮短計算時間。We using the triangulation constructed from the point ' s adjacent field, which is the nearest to the original local surface, to compute the point ' s normal. it can get a good result
本文採用了與局部曲面片最接近的由點的鄰域所構造的三角片來近似求點的法向量的方法,得到了較好的實驗結果。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
分割過程採用八叉樹來記錄,並利用包圍盒的遞歸特性實現了點的鄰域的快速搜索演算法,同時可以有效地排除噪聲點,顯著減少了密集散亂數據點雲幾何建模所花費的時間,提高了建模效率。It made use of randomly sampled one edge - point sampling randomly and locally searched two edge - points in an image and information of their neighborhoods to determine a candidate ellipse, then affirmed true ellipse for the candidate ellipse by affirming true circle for corresponding circle into which is transformed by the candidate ellipse
該演算法利用在圖像中隨機采樣到的一個邊緣點和局部搜索到的兩個邊緣點以及這三個點的鄰域信息確定候選橢圓,再將候選橢圓變換為對應圓,通過確認真圓來確認真橢圓。Based on data cloud, which is measured from 3 - coordinate measuring machine ( cmm ) or so, an algorithm to search lopological structure from 3d unorganized points using envelopment - box technology is proposed in this thesis. based on this method, we searching neighbor points of sampling point. we also improve the max - min angle criteria to realize local triangulation, and then get the normal of sampling point from the triangulation
本文以測量得到的曲面數據點點雲為基礎,提出了一種基於包圍盒的自動尋找三維散亂數據點之間拓撲結構的方法,採用該方法尋找采樣點的鄰域結點,並對三角剖分中的典型優化準則?最小內角最大準則提出了改進,按照改進后的優化準則實現了采樣點的局部三角劃分,並進一步求解得到采樣點的法向量,依據法向量及鄰域拓撲關系在二次曲面的基礎上實現了散亂數據曲面重構中的數據點的自動分類。On the basis of displacement - time series of the slope, a nonlinear dynamic model is set up according to backus generalized linear inversion theory in this paper. due to the equivalence beween autonomous gradient system and catastrophe model, a standard cusp catastrophe model can be obtained through variable substitution. the method is used in analysis of displacement data of huangci landslide and wolongsi landslide and in understanding how slopes evolve before sliding. the result shows that the nonlinear dynamic model can make satisfactory prediction result. is it most important that there is a sudden fall of d, which indicates the occurrence of catastrophe ( when d = 0 )
研究表明,滑坡變形失穩過程具有混沌和分維特性,可以用分形理論來研究滑坡預測問題,基於對任一連續函數,至少在較小的鄰域內可以用多項式任意逼近的數學理論,運用改進的backus廣義線性反演理論,以斜坡位移時間序列為基礎,反演了斜坡演化的非線性動力學模型。並利用自治梯度系統與突變模型的等價性,通過變量代換得到標準的尖點突變模型。Secondly, by making use of the characteristics of ergodicity and randomness of chaotic variables, the local search is performed by chaotic search in the neighborhoods of high affinity antibodies, and the chaotic search is carried out in the whole solution space to avoid sticking at local optima
然後,利用混沌變量的遍歷性和隨機性特點,通過在高親和力抗體的鄰域內進行混沌搜索以實現局部尋優,通過在整個解空間內的混沌搜索來避免陷入局部最優解。It is shown that the origin is indeed a critical point of higher order. there exsist different kinds of topological structures in a neighborhood of the origin
原點是一個高階奇點,在它的鄰域內存在多種拓撲結構。In chapter 3, the local structure of a scattered point set and its classical algorithms are investigated
第三章研究了散亂點集的鄰域結構及其經典演算法。Considering the potential parallelism of the image data, we developed the parallel algorithm. several critical techniques have been proposed to obtain a high performance combining the characters of smp clusters. in the end, we simulate our algorithm on pc clusters, from both theory analysis and experiment results, it is shown that our algorithms can provided an efficient way for image restoration applications
Wmf演算法主要是基於這樣一種思想,對于含噪圖像上受損的任一點,其鄰域中的像素對它的恢復過程中的貢獻是不同的,如果這一點的灰度值越接近該區域內的中值,則其貢獻相應的大一些,反之相應的小一些。In order to solve this problem, this paper proposes one kind of new topology - aware p2p network routing protocol and constructs its model tabip. it according to territorial continuity of ip address ( public network ip address ), and its node id and object id includes the information of ip address that is organized by country id. it is consistent between the node ’ s proximity of overlay network and physical node ’ s proximity
為了解決這一問題,本文提出一種新的拓撲相關p2p網路路由協議並構建其模型tabip ,它依據公網ip地址分配的區域連續性規律,在生成節點和對象標識符時加入按國家編號組織的ip地址信息,使得覆蓋網上節點的鄰近和實際節點的鄰近趨於一致。分享友人