Title: | The Brute-Force Generator of Triangulations with Required Properties |
Authors: | Hlavatý, Tomáš Skala, Václav |
Citation: | International Conference on Computer Vision and Graphics, p. 325-336. |
Issue Date: | 2002 |
Publisher: | Silesian University of Technology |
Document type: | konferenční příspěvek conferenceObject |
URI: | http://hdl.handle.net/11025/11695 |
ISBN: | 8391768309 |
Keywords: | globální optimum;hešovací tabulka;NP problém |
Keywords in different language: | global optimum;hash table;NP problem |
Abstract: | At present many heuristic algorithms searching for triangulations by a given criterion exist. The problem would be a good property for quality evaluation of this method but the exact solution with an error. The error would be a good property for quality evaluation of this method but the exact size of the error cannot be calculated without the knowledge of the exact solution, which represents a triangle mesh globally optimizing a criterion, has non-polynomical time complexity (NP problem). In this paper we present an algorithm generating a triangle mesh globally optimizing the general criterion. Unfortunately the time complexity is still non-polynomial but some new program techniques sre presented here that are used for decreasing the time of the computation.application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf |
Rights: | Plný text není přístupný. |
Appears in Collections: | Konferenční příspěvky / Conference Papers (KIV) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Skala_2002_BruteForce-Hlavaty.pdf | Plný text | 1,58 MB | Adobe PDF | View/Open Request a copy |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11695
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.