An O( n log 2 h ) time algorithm for the three-dimensional convex hull problem

DOI: 10.1137/0220016

关键词:

摘要: An algorithm is presented that constructs the convex hull of a set n points in three dimensions worst-case time $O(n\log ^2 h)$and storage $O(n)$, where h number extreme points. This an improvement $O(nh)$ gift-wrapping and, if $h = o(2^{\sqrt {\log _2 n} } )$, n)$ divide-and-conquer algorithm.

参考文章(0)

An O( n log 2 h ) time algorithm for the three-dimensional convex hull problem

来源期刊

我的账户

An O( n log 2 h ) time algorithm for the three-dimensional convex hull problem

来源期刊

相似文章 10

我的账户