پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 127 |
| تعداد شمارهها | 7,140 |
| تعداد مقالات | 76,846 |
| تعداد مشاهده مقاله | 154,476,204 |
| تعداد دریافت فایل اصل مقاله | 116,536,326 |
Efficient Preprocessing of 3D Data for Convex Hull Computation | ||
| Journal of Algorithms and Computation | ||
| دوره 57، شماره 2، اسفند 2025، صفحه 187-201 اصل مقاله (529.82 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2026.411069.1253 | ||
| نویسندگان | ||
| Mohammad Heydari* 1؛ Ashkan Khalifeh2 | ||
| 1Department of Computer Science, Khansar Campus, University of Isfahan, Iran | ||
| 2Department of Mathematical and Physical Sciences, College of Arts and Sciences, University of Nizwa, Nizwa 616, Sultanate of Oman | ||
| چکیده | ||
| 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. | ||
| کلیدواژهها | ||
| Convex hull؛ Algorithm؛ Computational geometry؛ Uniform distribution؛ Data Preprocessing | ||
|
آمار تعداد مشاهده مقاله: 47 تعداد دریافت فایل اصل مقاله: 53 |
||
سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب