摘要：对文献[1]的划分算法的时间复杂度进行理论分析,指出它的不适用范围.提出了一种计算凸包的O(n)的算法.
注：因版权方要求，不能公开全文，如需全文，请咨询杂志社
热门期刊服务
High Technology Letters Acta Oceanologica Sinica Acta Geologica Sinica Acta Metallurgica Sinica Acta Geologica Sinica Acta Pharmacologica Sinica Chinese Geographical Science Journal of Meteorological Research Journal of Wuhan University of Technology Science China Technological Sciences Journal of Geographical Sciences Journal of Huazhong University of Science and Technology