Red-Black Trees in JavaScript
Tuesday, March 30th, 2004Literally for years now, I’ve been wanting to implement a polygon intersection algorithm that I first found at Geometry Algorithms. Well, I made the first step last weekend and implemented a Red-Black Tree in JavaScript. That can be found on my Utilities page.
Admittedly, the Red-Black Tree example is not that interesting, but it served its purpose of making sure my code was behaving properly. I’m hoping that I’ll get to the fun stuff this weekend and actually have a better polygon-polygon intersection algorithm running on my site soon…after that, boolean operators.

