Generating Sequential Triangle Strips by Using Hopfield Nets
The important task of generating the minimum number of sequential triangle strips (tristrips) for a given triangulated surface model is motived by applications in computer graphics. This hard combinatorial optimization problem is reduced to the minimum energy problem in Hopfield nets by a linear-size construction. The Hopfield network powered by simulated annealing (i.e. Boltzmann machine) which is implemented in a program HTGEN can be used for computing the semi-optimal stripifications. Practical experiments confirm that one can obtain much better results using HTGEN than by a leading stripification program FTSG although the running time of simulated annealing grows rapidly near the global optimum.
KeywordsSimulated Annealing Sequential Cycle Boundary Edge Internal Edge Boltzmann Machine
Unable to display preview. Download preview PDF.
- Estowski, R., Mitchell, J.S.B., Xiang, X. (2002) Optimal decomposition of polygonal models into triangle strips. In: Proceedings of the 18th Annual Symposium on Computational Geometry. ACM Press, pp. 254–263.Google Scholar
- Pospíšil, D. (2002) Generating triangle strips by Hopfield network. Student’s project (in Czech), Faculty of Informatics, Masaryk University, Czech Republic.Google Scholar
- Šíma, J. (2004) Tristrips on Hopfield networks. Technical report V-908, Institute of Computer Science, Academy of Sciences of the Czech Republic.Google Scholar
- Šíma, J., Orponen, P. (2003) General-purpose computation with neural networks: A survey of complexity theoretic results. Neural Computation 75(12): 2727–2778.Google Scholar