A problem searching for an optimal triangulation with required properties is solved in this paper. Several new brute-force methods are sescribed. Although they have NP complexity, we try to accelerate the computational time as much as possible.
A problem searching for an optimal triangulation with required properties is solved in this paper. Several new brute-force methods are sescribed. Although they have NP complexity, we try to accelerate the computational time as much as possible. (en)
Tento clanek se zabyva problemem hledani optimalni triangulace pozadovanych vlastnosti. Je zde popsano nekolik metod, ktere resi dany problem %22brutalni silou%22. Ackoliv metody maji NP slozitost, pokousime se urychlit vypocet, jak je to jen mozne, abychom ziskali vysledky pro pokud mozno co nejrozsahlejsi mnoziny bodu. (cs)