Highly optimal techniques such as V-Clip leave even less room for improvement. In this case, dramatic simplification must be done in order to make a noticeable difference. For reference, the radius of the rabbit is 1 unit. This shows the potential of using our simplification technique in that the complexity of the convex hull can be substantially reduced if a small amount of error is acceptable. This applies to various physics, collision, and rendering algorithms that use convex polyhedra.
Simplification can introduce error, so it is important to prevent the less desirable types of error.
As mentioned earlier, it is considered unacceptable to see polygons sticking into each other in a 3D application. Therefore, the goal of our convex polyhedra simplification is to contain the original in any simplified version. The technique we presented simplifies a convex polyhedron by the plane removal operation which guarantees containment. The method is fast and can be used interactively by a user specifying the desired complexity of his convex polyhedra. The simplified convex polyhedra are not limited to triangles.