A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron.
Ian Hsieh, Kiat-Choong Chen, Cao An Wang · Canadian Conference on Computational Geometry · 2003
A minimum tetrahedralization of a convex polyhedron is a partition of the convex polyhedron with minimum number of tetrahedra. The problem of finding the minimum tetrahedralization of a convex polyhedron is known to be NP-Hard. In this paper, a genetic algorithm is presented to find an approximate solution to this problem. Our result always shows improvements to those produced by commonly used peeling and pulling methods.