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.
Results show significant reduction can be made for a small price in accuracy.
References Note that there are so many publications on simplification, it is not practical to include them all. David Baraff, Andy Witkin. Siggraph '97 Course notes, 1997. SEGA and PC CD-ROM video game, Copyright Bioware, Shiny, and Interplay Productions. Jonathan D Cohen, Ming C Lin, Dinesh Manocha, Madhav Ponamgi.