computational geometry - Convex hull algorithms for sorted set of points -
i need algorithm computation convex hulls sorted set of points in 3 , higher dimensions. need in lower part of convex hull , not necessary construct whole convex hull. there efficient , quick algorithms purposes?
i believe established seidel having points sorted not in terms of asymptotic time complexity, , lower half can entire hull, not either. randomized incremental (clarkson , shor) perhaps best choice. here applet illustration of algorithm: tufts link.
Comments
Post a Comment