chiark / gitweb /
use red-black tree in cdirect instead of repeatedly resorting ... convex_hull is...
authorstevenj <stevenj@alum.mit.edu>
Mon, 27 Aug 2007 14:49:28 +0000 (10:49 -0400)
committerstevenj <stevenj@alum.mit.edu>
Mon, 27 Aug 2007 14:49:28 +0000 (10:49 -0400)
commit5cf599b34f6f7f04ca330d1a72147c7090556ff9
tree5b2e193ac62eb280e6881d9b977f02faf598b62d
parent5074cd9932dd688d0de2ed4899dd1caf7fd95b60
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
cdirect/Makefile.am
cdirect/cdirect.c
cdirect/redblack.c [new file with mode: 0644]
cdirect/redblack.h [new file with mode: 0644]
cdirect/redblack_test.c [new file with mode: 0644]