Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barahona, F.: On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical and General 15(10), 3241–3253 (1982)
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)
Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences USA 79(8), 2554–2558 (1982)
Hopfield, J.J., Tank, D.W.: “Neural” computation of decision in optimization problems. Biological Cybernetics 52(3), 141–152 (1985)
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)
Šíma, J.: Tristrips on Hopfield networks. Technical report V-908, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague (2004)
Ší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)
Šíma, J., Orponen, P.: General-purpose computation with neural networks: A survey of complexity theoretic results. Neural Computation 15(12), 2727–2778 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Šíma, J. (2005). Optimal Triangle Stripifications as Minimum Energy States in Hopfield Nets. In: Duch, W., Kacprzyk, J., Oja, E., Zadrożny, S. (eds) Artificial Neural Networks: Biological Inspirations – ICANN 2005. ICANN 2005. Lecture Notes in Computer Science, vol 3696. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550822_32
Download citation
DOI: https://doi.org/10.1007/11550822_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28752-0
Online ISBN: 978-3-540-28754-4
eBook Packages: Computer ScienceComputer Science (R0)