Archive for September, 2006

Source Code Now Available

September 18, 2006

It was decided in the very beginning that this is an open source project since I benefited so much from other open source code. However, it still takes me considerable time to clean up the source before I can open it up. I started to use CVS to do version control, and then later found out SVN is now a more popular method. Like many other open source projects, I chose SourceForge to host it. I picked BSD license because it is less restricted. The result is far from perfect, but I finally managed to let it go. If you are interested in anything you see in this blog, check out the source code!


Box stacking in a bowl

September 16, 2006

Demonstrates collision between convex and concave geometries.

Single Valvetrain Simulation

September 14, 2006

At first glance, this is a very simple mechanism. Put a convex-convex contact joint between the cam and tappet and a spring force to restore the tappet to the original position. However, this leads to a complete overhaul of my collision detection scheme. The problem is between the valve seat and valve. I want a more realistic concave-convex type collision between them. How to handle a concave geometry? I have treaded the territory of signed distance map before and accumulated enough frustration. In addition, it does not fit my fundamental work on the feature-based geometry. Convex decomposition? Some geometry is inherently concave, such as the inside of a cylinder wall. Moreover, I am reluctant to invest even more time on the uncharted sea of collision detection. I need something simple and effective.

My solution is to have three types of geometry:

  1. Convex – a convex polytope or a convex surface patch that is not limited to a polyhedron.
  2. Complex – a triangle soup. A concept that is easy for me to grasp when I studied RAPID.
  3. Composite – a thing that is composed of convex and complex.

There is no primitive geometry such as box, sphere, or cylinder. Everything is built from triangle meshes. A non-polyhedron convex opens the floodgate to bugs roaming around my code. I spent a lot of time debugging but I think there is still some dormant bugs which I have not uncovered. There is no automatic schemes for convex decomposition. The user is responsible for identifying the convex parts in a composite. If it is very difficult to identify a part in a composite, that part deserves to be called complex. These geometries are supported by three colliders:

  1. ConvexConvexCollider – the fundamental element in the hierarchy that uses DEEP. Free edges cause me the most trouble.
  2. ComplexConvexCollider – the triangle soup is culled by an AABB tree. A single triangle and a convex collision is handled by ConvexConvexCollider.
  3. CompositeCompositeCollider – peels down the hierarchy to employ ConvexConvexCollider and ComplexConvexCollider.

Complex and complex collision is not allowed since I don’t know how to determine the penetration depth between two colliding objects when they are represented by two triangle soups. I am aware that ODE trimesh manages to do just that but it is not very reliable.

The model geometry is taken from ADAMS Engine, but the spring geometry is constructed by java code from Obviously, there is more to accurately model a spring than just to assign the spring stiffness. I didn’t include the spring details in the model and it seems lack of accuracy. But that work is left for the future improvement.