共 50 条
Fast approximation of convex hull
被引:0
|作者:
Kavan, Ladislav
[1
]
Kolingerova, Ivana
[2
]
Zara, Jiri
[1
]
机构:
[1] FEE CTU Prague, Karlovo Nam 13, Prague 2, Czech Republic
[2] Univ West Bohemia, Plzen, Czech Republic
来源:
PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER SCIENCE AND TECHNOLOGY
|
2006年
关键词:
convex hull;
approximation;
linear time;
D O I:
暂无
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
The construction of a planar convex hull is an essential operation in computational geometry. It has been proven that the time complexity of an exact solution is Omega(NlogN). In this paper, we describe an algorithm with time complexity O(N + k(2)), where k is parameter controlling the approximation quality. This is beneficial for applications processing a large number of points without necessity of an exact solution. A formula for upper bound of the approximation error is presented.
引用
收藏
页码:101 / +
页数:2
相关论文