Number of the records: 1
Generating Sequential Triangle Strips by using Hopfield Nets
- 1.
SYSNO ASEP 0405294 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title Generating Sequential Triangle Strips by using Hopfield Nets Title Generování sekvenčních trojúhelníkových pásů pomocí Hopfieldových sítí Author(s) Šíma, Jiří (UIVT-O) RID, SAI, ORCID Source Title Adaptive and Natural Computing Algorithms. - Wien : Springer-Verlag, 2005 / Ribiero B. ; Albrecht R. ; Dobnikar A. ; Pearson D. ; Steele N. - ISBN 3-211-24934-6 Pages s. 25-28 Number of pages 4 s. Action ICANNGA'2005 /7./ Event date 21.03.2005-23.03.2005 VEvent location Coimbra Country PT - Portugal Event type WRD Language eng - English Country DE - Germany Keywords sequential triangle strip ; combinatorial optimization ; Hopfield network ; minimum energy ; simulated annealing Subject RIV BA - General Mathematics R&D Projects 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) LN00A056 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) UT WOS 000229368400007 DOI 10.1007/3-211-27389-1_7 Annotation 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. Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2010
Number of the records: 1