Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XXXIX-B2, 63-66, 2012
https://doi.org/10.5194/isprsarchives-XXXIX-B2-63-2012
© Author(s) 2012. This work is distributed under
the Creative Commons Attribution 3.0 License.
 
25 Jul 2012
AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET
Z. Fu and Y. Lu School of Remote Sensing and Information Engineering, Wuhan University, Wuhan, Hubei, 430079, P.R. China
Keywords: Scattered Point Set, Minimum Convex Hull, Convex Hull Algorithm, Initial Boundary of Convex Hull Abstract. 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.
Conference paper (PDF, 524 KB)


Citation: Fu, Z. and Lu, Y.: AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET, Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XXXIX-B2, 63-66, https://doi.org/10.5194/isprsarchives-XXXIX-B2-63-2012, 2012.

BibTeX EndNote Reference Manager XML