如果您无法下载资料，请参考说明：
1、部分资料下载需要金币，请确保您的账户上有足够的金币
2、已购买过的文档，再次下载不重复扣费
3、资料包下载后请先用软件解压，在使用对应软件打开
ComputingConvexHullIntroductionConvexHullAlgorithmApplicationConclusionQuestion1:whatisconvexhull？GivenasetS={p1，p2，···，pn}ofpointsintheplane，theconvexhullH(S)isthesmallestconvexpolygonintheplanethatcontainsallthepointsofS.Question2:what’sthedefinitionofconvexhull？TheminimalconvexpolygoncontainingSTheintersectionofallconvexsetscontainingSTheintersectionofallhalfspacescontainingS56789Manyapplications：patternrecognitiondigitalimageprocessingrobotmotionplanninggeographicinformationsystemConvexhullisthemostelementarystructureincomputationalgeometrywithmanyapplications.Graham’sscanalgorithmhasthetimecomplexityO(nlogn).Whenthenumberofhullverticesissmall,Jarvis’MarchalgorithmwithtimecomplexityO(nh)canbeused.Stillnumbersofoptimalalgorithm,dynamicalgorithmandarbitraryalgorithm.http://en.wikipedia.org/wiki/Convex_hullhttp://en.wikipedia.org/wiki/Convex_hull_algorithmsJarvis,R.A.Ontheidentificationoftheconvexhullofafinitesetofpointsintheplane.InformationProcessingLetters,1973,2:18–21.Graham,R.L.AnEfficientAlgorithmforDeterminingtheConvexHullofaFinitePlanarSet.InformationProcessingLetters,1972,1:132-133.Andrew,A.M.Anotherefficientalgorithmforconvexhullsintwodimensions.InformationProcessingLetters,1979,9(5):216–219.TimothyM.Chan.Optimaloutput-sensitiveconvexhullalgorithmsintwoandthreedimensions.DiscreteandComputationalGeometry,1996,16:361–368.13
立即下载
