Cross Product and Partitioned Filtering-Based Graham Convex Hull for Buoy Drifting Area Demarcating

An improved Graham scan convex hull algorithm is designed using the convex hull region shrinkage algorithm and the sample selection decision algorithm. In the sorting of Graham scan convex hull algorithm, the cross-multiplication method is used instead of the operation of finding the polar angle, which avoids the high computational complexity of finding the inverse trigonometric function. When the polar angles are the same, that is, the two points are collinear, the points close to each other are deleted directly. Select the maximal horizontal ordinate point, minimal horizontal ordinate point, maximal longitudinal coordinate point, and minimal longitudinal coordinate point. Connect these points and obtain lines. The whole plane is divided into different regions. The points that are not on the convex hull are deleted, and the redundant points are removed. This can speed up the calculation of approximate convex hull boundary and shorten the time of convex hull calculation. The proposed algorithm is used for buoy drifting area demarcating. The offsets of the geometric center of the high-frequency position point and the distance from geometric center of high-frequency position of buoy to sinking stone are calculated. The experimental results show that the new algorithm can effectively accelerate the convex hull calculation. We use the convex hull process to compute the area of the drifting buoy position and discover that the drift area of the port hand buoy is similar. The drift area of the port hand buoys is similar. The drift area of the port hand buoy is greater than that of the port hand buoy.