• Join Us |
  • |
  • Sign in with:

Evening Reading

by Steve Gibson, Oct 26, 2006 6:00pm PDT
Related Topics – Wack News

So holding out for a while I got one of them Logitech G5 mouse thingies and I'm quite happy with it. I didnt think I would care about being able to adjust the weight but it really did make a bit of a difference for me. I can now click porn 17% faster!

- Dotcom bubble 2.0 is coming! - Maxim steak house - Face blind - YouTube party is over - War on Redhat - Zune wont crap on iPod parade
Lastly, your cell phone is hurting your swimmers



































  • Shot in the dark...

    okay, I'm working on a Data Structures project. I have a Triangle Point Region Quadtree, which is basically just a PR Quadtree with triangles connecting the points. There is a list of all the triangles that intersect a region in all the full leaf nodes. Full leaf nodes are now defined as leaf nodes with triangles, and they may or may not have a vertex. I need to implement a triangle split operation where I take a new vertex from input and insert it into the quadtree. Then I split the triangle it falls under into three triangles, connecting all the points with the new vertex in the middle. It sounds easy enough but I'm only allowed to go through the quadtree once and I'm not allowed to visit and nodes that do not intersect the triangle. I can't figure out how to know which triangle the vertex falls under until I arrive at the leaf node that will store the vertex. At that point, how can I go back and fuck with the triangle in the other nodes where it is listed?