University Of Tehran Press Journal of Algorithms and Computation 2476-2776 57 2 2025 12 01 Efficient Preprocessing of 3D Data for Convex Hull Computation 187 201 106213 10.22059/jac.2026.411069.1253 EN Mohammad Heydari Department of Computer Science, Khansar Campus, University of Isfahan, Iran Ashkan Khalifeh Department of Mathematical and Physical Sciences, College of Arts and Sciences, University of Nizwa, Nizwa 616, Sultanate of Oman Journal Article 2026 02 13 Computing the convex hull of a set of points is a fundamental problem in computer science that has applications in various scientific and engineering domains. This paper presents a preprocessing algorithm, named Tiling, that can be utilized before any desired algorithm for computing the convex hull of a set of $n$ points randomly distributed in $\mathbb{R}^3$ by uniform distribution. The key contributions of this work are threefold. First, we provide a complete preprocessing algorithm with detailed implementation. Second, we present rigorous experimental validation showing $2-2.6\times$ performance improvements over the widely used Qhull implementation when applied to uniformly distributed point sets in space. Third, our algorithm demonstrates the ability to eliminate approximately $95-97\%$ of input points while maintaining convex hull correctness, significantly reducing the computational burden for subsequent hull computation. https://jac.ut.ac.ir/article_106213_e13bf3d6633aed1f1ae964294fe4a77c.pdf