Optimal triangle stripifications as minimum energy states in hopfield nets

Authors:
Jiří Šíma
Affiliations:
Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague 8, Czech Republic
Venue:
ICANN'05 Proceedings of the 15th international conference on Artificial Neural Networks: biological Inspirations - Volume Part I
Year:
2005

Citing 2
Cited 1

Optimal decomposition of polygonal models into triangle strips

Proceedings of the eighteenth annual symposium on Computational geometry
General-purpose computation with neural networks: a survey of complexity theoretic results

Neural Computation

Sequential triangle strip generator based on hopfield networks

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

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.