CONVEX-HULL - A PASCAL PROGRAM FOR DETERMINING THE CONVEX-HULL FOR PLANAR SETS

Computer aided graphical display of geological data is usually based o n a regular grid, interpolated from a scattered data set. However, the interpolation function is valid only inside the domain of sampling po ints, or a closed boundary which limits all the sampling points. This closed boundary, named convex hull, can be determined with the aid of an algorithm. The convex hull of a planar set of points is defined as the minimum area convex polygon containing all the points. This paper presents a review of current methods for determining the convex hull, and the computer program CONVEX_HULL, written in Pascal language and b ased on a new algorithm. (C) 1997 Elsevier Science Ltd.