AN OPTIMAL CONVEX-HULL ALGORITHM IN ANY FIXED DIMENSION
AN OPTIMAL CONVEX-HULL ALGORITHM IN ANY FIXED DIMENSION
复制标题
DOI：
10.1007/bf02573985
复制
发表时间：
1993-01-01
影响因子：
0.8
通讯作者：
CHAZELLE, B
中科院分区：
文献类型：
--
作者：
CHAZELLE, B
我们提出了一种确定性算法，用于计算最佳O（n log n + n右垂直d/2左垂直）时间中e（d）中n个点的凸壳。以前仅在偶数和尺寸3中都知道最佳溶液。我们结果的副产品是一种用于计算最佳O中d空间中n个点的voronoi图的算法（n log n log n + n倒置右垂直D/ 2倒左垂直）时间。
We present a deterministic algorithm for computing the convex hull of n points in E(d) in optimal O(n log n + n right perpendicular d/2 left perpendicular) time. Optimal solutions were previously known only in even dimension and in dimension 3. A by-product of our result is an algorithm for computing the Voronoi diagram of n points in d-space in optimal O(n log n + n inverted right perpendicular d/2 inverted left perpendicular) time.