Advertisement

Generating Sequential Triangle Strips by Using Hopfield Nets

  • Jiří Šíma

Abstract

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.

Keywords

Simulated Annealing Sequential Cycle Boundary Edge Internal Edge Boltzmann Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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
  2. [2]
    Pospíšil, D. (2002) Generating triangle strips by Hopfield network. Student’s project (in Czech), Faculty of Informatics, Masaryk University, Czech Republic.Google Scholar
  3. [3]
    Šíma, J. (2004) Tristrips on Hopfield networks. Technical report V-908, Institute of Computer Science, Academy of Sciences of the Czech Republic.Google Scholar
  4. [4]
    Hopfield, J.J. (1982) Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences USA 79(8): 2554–2558.MathSciNetCrossRefGoogle Scholar
  5. [5]
    Barahona, F. (1982) On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical and General 75(10): 3241–3253.MathSciNetCrossRefGoogle Scholar
  6. [6]
    Hopfield, J.J., Tank, D.W. (1985) “Neural” computation of decision in optimization problems. Biological Cybernetics 52(3): 141–152.MathSciNetGoogle Scholar
  7. [7]
    Ší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
  8. [8]
    Ackley, D.H., Hinton, G.E., Sejnowski, T.J. (1985) A learning algorithm for Boltzmann machines. Cognitive Science 9(1): 147–169.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag/Wien 2005

Authors and Affiliations

  • Jiří Šíma
    • 1
  1. 1.Institute of Computer ScienceAcademy of Sciences of the Czech RepublicPrague 8Czech Republic

Personalised recommendations