[ODE] StanHull

[Erwin Coumans]

This convex hull generation is only a replacement of qhull. So it is an 
authoring help instead of a collision detection algorithm. It removes 
internal vertices of a point cloud and builds connectivity to the vertices 
on the hull.

You still need a convex hull collision detection algorithm. The 2 most 
popular algorithms are GJK or Separating Axis Test (SAT). SAT is what ODE 
uses for the box-box code for example.

Bullet collision detection has GJK convex hull collision support, and convex 
SAT is upcoming as a contribution.

Erwin
www.continuousphysics.com/Bullet


----- Original Message ----- 
From: "J. Perkins" <starkos at gmail.com>
To: "ode-list" <ode at q12.org>
Sent: Monday, March 06, 2006 4:59 AM
Subject: [ODE] StanHull


> In case you are not on the gd-algorithms list, John Ratcliff just
> posted a new open-source convex hull generator, originally written by
> Stan Melax:
>
> http://codesuppository.blogspot.com/2006/03/john-ratcliffs-code-suppository-blog.html
>
> Is this something ODE could use? There have been discussions about
> adding a convex hull collision primitive here before.
>
> Jason
>
> _______________________________________________
> ODE mailing list
> ODE at q12.org
> http://q12.org/mailman/listinfo/ode
>