The Brute-Force Generator of Triangulations with Required Properties

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