Study of Optimizing Method for Algorithm of Minimum Convex Closure Building for 2D Spatial Data
Wang Jie-chen · 2002
The minimum convex closure is one of the widely studied problems in science of computing geometry, as well as extensively applied in many fields of GIS. One of the commonly used algorithm for building minimum convex closure has been discussed in this paper. In order to increase operation speed, the author put forward an improved method based on grouping data computing and removing useless points, and analyzed the relationships between algorithm efficiency with the convex closure characteristic and subset points number by some testing.