期刊名称：ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
印刷版ISSN：2194-9042
电子版ISSN：2194-9050
出版年度：2012
卷号：XXXIX-B2
页码：63-66
DOI：10.5194/isprsarchives-XXXIX-B2-63-2012
出版社：Copernicus Publications
摘要：Computing the convex hull of a point set is requirement in the GIS applications. This paper studies on the problem of minimum convex hull and presents an improved algorithm for the minimum convex hull of planar scattered point set. It adopts approach that dividing the point set into several sub regions to get an initial convex hull boundary firstly. Then the points on the boundary, which cannot be vertices of the minimum convex hull, are removed one by one. Finally the concave points on the boundary, which cannot be vertices of the minimum convex hull, are withdrew. Experimental analysis shows the efficiency of the algorithm compared with other methods
关键词：Scattered Point Set; Minimum Convex Hull; Convex Hull Algorithm; Initial Boundary of Convex Hull
