I'm sick of hearing about Chrome. I don't care. Please stop it.
I've been toying a bit with CSG, using BSP trees. Here's a cow and a dodecahedron. Here's the cow minus the dodecahedron.
The idea is to use this in a (possibly multiplayer) 3D space combat game where you can punch new craters on asteroids. With some basic rigid body dynamics, it could look really cool. Unfortunately, the BSP tree approach seems to generate way too many polygons. I also had a look at the approach to CSG used in GtkRadiant. It's based on implicit convex volumes ("brushes") - a subtraction operation generates new brushes on demand. It could be made to work in real time. Next I'll work on a demo where you can interactively carve holes on an object using both approaches in order to compare them.
And this looks incredible.
FOAF updates: Trust rankings are now exported, making the data available to other users and websites. An external FOAF URI has been added, allowing users to link to an additional FOAF file.
Keep up with the latest Advogato features by reading the Advogato status blog.
If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!