Optimizing convex hull discovery: Introducing a quintuple-region algorithm with enhanced computational efficiency

Abstract

This paper introduces a novel algorithm for computing the convex hull of a finite set of points in two-dimensional space. Unlike traditional methods, this algorithm strategically partitions the input set into five distinct regions, isolating interior points to reduce computational efforts while determining the convex hulls of the four boundary regions. This innovative approach significantly diminishes the required number of operations, achieving a computational complexity of O(nk), where k denotes the number of vertices on the convex hull and n is the number of vertices. The study methodically elaborates on the development of this algorithm, starting with a comprehensive overview of convex hull related terminology and existing methodologies. Subsequent sections detail the process of identifying endpoints within the set, the division of the set into specific regions, and the application of proposed algorithms for each region to efficiently compute their convex hulls. Through theoretical analysis and case studies presented in the latter sections, this paper not only enhances understanding of convex hull computation but also demonstrates the practical efficiency and effectiveness of the proposed algorithm in various scenarios. This advancement represents a significant contribution to the field of computational geometry, offering improved solutions for problems involving two-dimensional spatial analysis.

Keywords

• Computational geometry
• Convex hull
• Circuit covering
• Algorithm