Optimal Triangle Stripifications as Minimum Energy States in Hopfield Nets
The important task of generating the minimum number of sequential triangle strips 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. First practical experiments have confirmed that computing the semi-optimal stripifications by using Hopfield nets is a promising approach. In this work we provide a theoretical justification of this method by proving that the classes of equivalent optimal stripifications are mapped one to one to the minimum energy states.
Unable to display preview. Download preview PDF.
- 2.Estkowski, R., Mitchell, J.S.B., Xiang, X.: Optimal decomposition of polygonal models into triangle strips. In: Proceedings of the 18th Annual Symposium on Computational Geometry, pp. 254–263. ACM Press, New York (2002)Google Scholar
- 5.Pospíšil, D.: Generating triangle strips by Hopfield network. In: Pospíšil, D. (ed.) Student’s project (in Czech), Faculty of Informatics, Masaryk University, Czech Republic (2002) Google Scholar
- 6.Šíma, J.: Tristrips on Hopfield networks. Technical report V-908, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague (2004)Google Scholar
- 7.Šíma, J.: Generating sequential triangle strips by using Hopfield nets. In: Proceedings of the ICANNGA 2005 7th International Conference on Adaptive and Natural Computing Algorithms, pp. 25–28. Springer, Vienna (2005)Google Scholar