![]() ![]() ![]() Its real-life performance compared with other convex hull algorithms is favorable when n is small or h is expected to be very small with respect to n. Jarvis, who published it in 1973 it has O( nh) time complexity, where n is the number of points and h is the number of points on the convex hull. In the two-dimensional case the algorithm is also known as Jarvis march, after R.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |