convex hulls造句
例句與造句
- for any integer k 1 let g ( k ) be the smallest integer such that every set of points in the plane with no three collinear and at least g ( k ) interior points has a subset whose convex hull contains exactly k interior points
對(duì)任何整數(shù)k1,設(shè)g(k)為滿(mǎn)足以下條件的最小正整數(shù):至少含有g(shù)(k)個(gè)內(nèi)點(diǎn)且無(wú)三點(diǎn)共線(xiàn)的平面點(diǎn)集必存在恰含有k個(gè)內(nèi)點(diǎn)的子集。 - fixed direction hulls is a special convex hull, whose outward normal of facets comes from a fixed direction set . it overcome limitations of other bounding volumes and makes a promise between tightness and simpleness
固定方向凸包是一種特殊類(lèi)型的凸包,它的所有面方向都來(lái)自一個(gè)固定的方向集合,它克服了以往包圍盒類(lèi)型的缺點(diǎn),在緊密性和簡(jiǎn)單性之間達(dá)到了一定的折衷。 - these invariants were used to establish the correspondence between the convex hull vertices of the test image and the reference image in order to undo the affine transformation between them, and then a feature points matching approach for recognition followed this
通過(guò)比較參考圖和測(cè)試圖特征向量的一致性,建立它們的仿射變換關(guān)系,最后利用凸殼內(nèi)特征點(diǎn)的匹配來(lái)實(shí)現(xiàn)識(shí)別和配準(zhǔn)。 - in quick feasibility checking, a convex hull is applied to check whether a tool orientation is feasible . if the tool orientation by using this algorithm is not feasible, the detailed feasibility checking is developed to detect the global tool interference
在快速檢測(cè)中,根據(jù)參數(shù)曲面的凸包特性粗檢現(xiàn)行的刀具方向與凸包之間是否存在干涉,若不存在,則刀具方向是可行的;否則,需通過(guò)詳細(xì)檢測(cè)來(lái)進(jìn)行最終檢測(cè)。 - based on nonsmooth analysis theory, the viability criterion is verified under the condition that the set-valued mapping in the right hand side is a polytope and the boundary function of the region is subdifferentiable and its subdifferential is a convex hull of finitely many points
當(dāng)右端集值映射為多面體,邊界為次可微函數(shù),且次微分為有限點(diǎn)集凸包時(shí),基于非光滑分析理論,給出了在一點(diǎn)處檢驗(yàn)生存性條件是否成立的方法。 - It's difficult to find convex hulls in a sentence. 用convex hulls造句挺難的
- 2 . this thesis initiatively proposes the producing algorithm of ordinary tin, based on the convex hull technique . through real practice and theoretical analysis, the time complexity of this algorithm is close to o ( n ), so we had solved the bottleneck problem in dem producing
創(chuàng)造性地提出了基于“凸殼技術(shù)”的普通三角網(wǎng)快速聯(lián)結(jié)算法,通過(guò)實(shí)際應(yīng)用和理論分析,其時(shí)間復(fù)雜度近似為0(n),解決了dem建立過(guò)程中所存在的算法瓶頸問(wèn)題。 - then, incremental algorithm for convex hull and gjk algorithm are employed to improve the spilt algorithm's performance . then, the thought of uniform-cost search is applied to improve the algorithm . the implement shows that the improved split algorithm is more quickly
并且,根據(jù)分裂算法的特點(diǎn),綜合使用求解nurbs曲面控制頂點(diǎn)的凸包圍多面體的增量算法和求解凸多面體之間距離的gjk算法替代了包圍盒(aabb)算法,對(duì)于分裂算法做了改進(jìn)。 - this method embeds the source and target polygons in compatible planar triangulations whose boundaries are the magnified convex hull of polygons respectively, then morph the embedded triangulations with the convexity-preserving method for morphing compatible planar triangulations presented in this paper
該方法將初末多邊形嵌入到以其放大凸包為邊界的同構(gòu)平面三角網(wǎng)格中,采用本文提出的同構(gòu)平面三角網(wǎng)格的保凸變形方法對(duì)所得網(wǎng)格進(jìn)行變形。 - the primary idea of the acceleration algorithm focus on the boundary of point set . because only the boundary of a point set is the critical to a convex hull, other point needs not considered . but in classical algorithm, all the point takes part in the calculation
加速算法的思想是這樣的,對(duì)于一個(gè)凸包,算法真正關(guān)心的是它的邊界上的點(diǎn),其它的點(diǎn)實(shí)際上是不需參與運(yùn)算的,但是在傳統(tǒng)的算法中,所有的點(diǎn)都要參加運(yùn)算,這就會(huì)浪費(fèi)一些不必要的時(shí)間。 - relying on the theorem of graham, the sample points are realized the minimal convex hull which computational complexity is o ( nlogn ) . last a new feature extraction-convex-body segmentation and approximation of scattered sample for non-linear classification based on the knowledge of computing geometry and discrete mathematics is presented . new algorithm guarantees that every convex hull is unintersectant . both convex hull between the same classes and convex hull between the different classes are unintersectant
在此基礎(chǔ)上,借助計(jì)算幾何和離散數(shù)學(xué)等相關(guān)知識(shí),為非線(xiàn)性分類(lèi)問(wèn)題中的特征提取提出新的思路-散亂樣本凸體分割與逼近算法,算法保證了兩類(lèi)樣本形成的凸包兩兩互不相交,即同類(lèi)樣本之間、同類(lèi)和異類(lèi)之間形成的凸包互不相交,并且凸包數(shù)量逼近最少,為非線(xiàn)性分類(lèi)提供了新的研究思路。 - relying on the theorem of graham, the sample points are realized the minimal convex hull which computational complexity is o ( nlogn ) . last a new feature extraction-convex-body segmentation and approximation of scattered sample for non-linear classification based on the knowledge of computing geometry and discrete mathematics is presented . new algorithm guarantees that every convex hull is unintersectant . both convex hull between the same classes and convex hull between the different classes are unintersectant
在此基礎(chǔ)上,借助計(jì)算幾何和離散數(shù)學(xué)等相關(guān)知識(shí),為非線(xiàn)性分類(lèi)問(wèn)題中的特征提取提出新的思路-散亂樣本凸體分割與逼近算法,算法保證了兩類(lèi)樣本形成的凸包兩兩互不相交,即同類(lèi)樣本之間、同類(lèi)和異類(lèi)之間形成的凸包互不相交,并且凸包數(shù)量逼近最少,為非線(xiàn)性分類(lèi)提供了新的研究思路。 - relying on the theorem of graham, the sample points are realized the minimal convex hull which computational complexity is o ( nlogn ) . last a new feature extraction-convex-body segmentation and approximation of scattered sample for non-linear classification based on the knowledge of computing geometry and discrete mathematics is presented . new algorithm guarantees that every convex hull is unintersectant . both convex hull between the same classes and convex hull between the different classes are unintersectant
在此基礎(chǔ)上,借助計(jì)算幾何和離散數(shù)學(xué)等相關(guān)知識(shí),為非線(xiàn)性分類(lèi)問(wèn)題中的特征提取提出新的思路-散亂樣本凸體分割與逼近算法,算法保證了兩類(lèi)樣本形成的凸包兩兩互不相交,即同類(lèi)樣本之間、同類(lèi)和異類(lèi)之間形成的凸包互不相交,并且凸包數(shù)量逼近最少,為非線(xiàn)性分類(lèi)提供了新的研究思路。 - relying on the theorem of graham, the sample points are realized the minimal convex hull which computational complexity is o ( nlogn ) . last a new feature extraction-convex-body segmentation and approximation of scattered sample for non-linear classification based on the knowledge of computing geometry and discrete mathematics is presented . new algorithm guarantees that every convex hull is unintersectant . both convex hull between the same classes and convex hull between the different classes are unintersectant
在此基礎(chǔ)上,借助計(jì)算幾何和離散數(shù)學(xué)等相關(guān)知識(shí),為非線(xiàn)性分類(lèi)問(wèn)題中的特征提取提出新的思路-散亂樣本凸體分割與逼近算法,算法保證了兩類(lèi)樣本形成的凸包兩兩互不相交,即同類(lèi)樣本之間、同類(lèi)和異類(lèi)之間形成的凸包互不相交,并且凸包數(shù)量逼近最少,為非線(xiàn)性分類(lèi)提供了新的研究思路。 - according to properties of h-bezier basis, h-bezier curves are endowed with wonderful geometric properties including interpolating at endpoints, convex hull, affine invariance and optimal shape preserving . furthermore, a shape factor of the h-bezier curve is introduced to control the shape of the designing curves
基于h-bzier基函數(shù)的幾何性質(zhì),h-bzier曲線(xiàn)具有適合cad中曲線(xiàn)建模和形狀設(shè)計(jì)的保形性,端點(diǎn)插值性,凸包性,幾何不變性和形狀控制等很好的幾何性質(zhì) - secondly, according to convex geometric characteristics, a common-perpendicular-line algorithm is developed for the distance between the convex nurbs surfaces by making surfaces discrete, approximating the distance by one between convex hulls of discrete surfaces and solving a linear programming problem to get their vertical projective length on common perpendicular direction, that is, the original distance
然后,針對(duì)凸曲面的幾何特征,給出了nurbs凸曲面間距離求解的公垂線(xiàn)法和切平面法。公垂線(xiàn)法是把曲面間的距離求解問(wèn)題轉(zhuǎn)化成曲面的離散點(diǎn)生成的凸殼間的距離,再歸之為兩凸殼在其公垂線(xiàn)上投影集合間的距離,由此抽象成一個(gè)線(xiàn)性規(guī)劃問(wèn)題,估算出近點(diǎn)對(duì)。