A Fast Convex Hull Algorithm of Planar Point Set
2013 ◽
Vol 706-708
◽
pp. 1852-1855
In this paper ,a new algorithm is proposed for improving speed of calculating convex hull of planar point set .The algorithm creates a square mesh to manage points ,when eliminating points which are obviously in convex hull ,selecting or eliminating of points can be converted to that of grid , work of calculation depends on points near edges of convex hull and density of grid but not the number of points ;at the meantime ,remainder points are sorted roughly .When calculating convex hull of remainder points ,a method is presented which can take advantage of order of remainder points ,it calculates boundaries of convex hull segment by segment ,then ,combines the boundaries to form convex hull.
2014 ◽
Vol 39
(11)
◽
pp. 7785-7793
◽
2013 ◽
Vol 27
(08)
◽
pp. 1354008
Keyword(s):
2007 ◽
Vol 8
(8)
◽
pp. 1210-1217
◽
2014 ◽
Vol 571-572
◽
pp. 721-724