您要查找的是不是：
- Convex hull problem is one of the fundamental problems in computer graphics,image processing,CAD/ CAM and pattern recognition. 確定平面點(diǎn)集的凸殼問(wèn)題在計算機圖形學(xué)、圖像處理、CAD/CAM、模式識別等眾多領(lǐng)域中有廣泛的應用。
- ConvexHullReplacer Replaces the geometry of the feature with a polygon representing its convex hull. 將圖形改為其外接凸多邊形。
- Hardness of convex hull is bigger than that of pit portion on sculptured plant surfaces. 植物非光滑葉表形態(tài)中凸包處硬度較凹坑處的硬度大；
- An easy approach is to create a convex hull around an object's location at two different times. 一條簡(jiǎn)單的途徑就是在不同的時(shí)間在一個(gè)物體的地點(diǎn)附近創(chuàng )造凸殼。
- An improved image recognition and registration algorithm based on convex hull and affine invariant was presented. 摘要提出了一種新的基于凸殼和仿射不變量的圖像識別和配準的方法。
- According to some relative definations, this paper proposed a triangulation of convex hull based on a monotonic chain. 在分析應用相關(guān)定義的基礎上,該文提出了一種基于單調鏈法的凸殼三角剖分方法。
- The illustration also shows the spline's convex hull, which is a polygon formed by connecting the four points with straight lines. 該插圖還顯示樣條的凸包,凸包是通過(guò)將這四個(gè)點(diǎn)用直線(xiàn)相連而形成的多邊形。
- Abstract An improved image recognition and registration algorithm based on convex hull and affine invariant was presented. 摘要提出了一種新的基于凸殼和仿射不變量的圖像識別和配準的方法。
- Secondly，the suitable parameter is selected to extract the super ball’s lamella which is used to construct the convex hull. 其次，選取合適的參數，提取單位超球體的外殼，用外殼中的點(diǎn)構造其凸包。
- We propose to analyze the spacial conformation of particles by integrating the concepts of the convex hull, hypergraph and depth. 摘要本文的主要目的是把空間多面體、超圖與深度這三個(gè)概念綜合起來(lái)，作為描述與分析空間質(zhì)點(diǎn)系形態(tài)的基本工具。
- Privacy-preserving protocol for finding the convex hulls is a special case of secure multi-party computation problem. 保護私有信息的凸包求解問(wèn)題是一個(gè)特殊的安全多方計算問(wèn)題。
- Finally,the learnability of a concept class C with respect to the probability measures P and its convex hull C(P) is discussed and a mistake of [1] is corrected. 最后討論了概念族C關(guān)于概率族P及其凸包C(P)的可學(xué)習性，并糾正了文[1]的一點(diǎn)錯誤。
- The NEM interpolant is strictly linear between adjacent nodes on the boundary of the convex hull, which facilitates imposition of essential boundary conditions. 根據基本邊界條件，自然鄰接插值在凸體邊界相鄰節點(diǎn)之間是嚴格線(xiàn)性的，于是可以用自然單元法來(lái)模擬非凸體表面裂紋。
- ConvexHullAccumulator Creates convex hulls for groups of features. 生成分組要素的外接凸多邊形。
- Castanea henryi is the famous special product of north Fujian,the hulling problem of C. 錐栗是閩北的著(zhù)名特產(chǎn),為開(kāi)發(fā)各種各樣的錐栗深加工新產(chǎn)品,首先要解決錐栗的脫殼去紅衣問(wèn)題。
- There are many existing algorithms to determine the convex hull of a finite planar set,but some of them are very complicated and some are very difficult to be implemented and coded. 現有多種求平面上點(diǎn)集凸殼的方法,但這些方法要么算法非常復雜,要么編碼及實(shí)現非常困難。
- An Improved Real Time Algorithm of Convex Hull 一種改進(jìn)的實(shí)時(shí)凸殼算法
- Algorithm on the Convex Hull of A Simple Polygon 簡(jiǎn)單多邊形凸包的算法
- I look at this problem from a different viewpoint. 我從不同的觀(guān)點(diǎn)來(lái)看這個(gè)問(wèn)題。
- nearest neighbor convex hull ( NNCH ) classifier 最近鄰凸包分類(lèi)
