The important task of generating the minimum number of sequential triangle strips (tristrips) for a given triangulated surface model is motivated by applications in computer graphics. This hard combinatorial optimization problem is reduced to the minimum energy problem in stochastic Hopfield nets empowered by simulated annealing. Practical experiments confirm that one can obtain much better results than with a leading conventional stripification program FTSG (which is a reference stripification method not based on neural nets) although the running time of simulated annealing grows rapidly near the global optimum.
Nevertheless, our approach exhibits empirical linear time complexity when the parameters of simulated annealing are fixed, and thus provides the semioptimal offline solutions even for huge models of hundreds of thousands of triangles within reasonable time.
Last modified: Tuesday, 05-Aug-2008 11:41:37 NZST
This page is maintained by the seminar list administrator.