use red-black tree in cdirect instead of repeatedly resorting ... convex_hull...
use red-black tree in cdirect instead of repeatedly resorting ... convex_hull is still O(N), though, and needs to be changed to a dynamic-hull algorithm to reduce the overall complexity below O(N^2), ugh darcs-hash:20070827144928-c8de0-1d7b7b1b20a5f1ca81fc7e9b31a79ee2bd4479c8.gz
Showing
cdirect/redblack.c
0 → 100644
cdirect/redblack.h
0 → 100644
cdirect/redblack_test.c
0 → 100644
想要评论请 注册 或 登录