Optimal Triangle Stripifications as Minimum Energy States in Hopfield Nets

0339969 - ÚI 2010 RIV DE eng C - Conference Paper (international conference)
Šíma, Jiří
Optimal Triangle Stripifications as Minimum Energy States in Hopfield Nets.
Artificial Neural Networks: Biological Inspirations – ICANN 2005. Berlin: Springer, 2005 - (Duch, W.; Kacprzyk, J.; Oja, E.; Zadrozny, S.), s. 199-204. Lecture Notes in Computer Science, 3696. ISBN 3-540-28752-3.
[ICANN 2005. International Conference on Artificial Neural Networks /15./. Warsaw (PL), 11.09.2005-15.09.2005]
R&D Projects: GA AV ČR 1ET100300517
Institutional research plan: CEZ:AV0Z10300504
Keywords : sequential triangle strip * combinatorial optimization * Hopfield network * minimum energy * simulated annealing
Subject RIV: IN - Informatics, Computer Science

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.
Permanent Link: http://hdl.handle.net/11104/0183325