Combinatories and triangulations

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F04%3A00000045" target="_blank" >RIV/49777513:23520/04:00000045 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Combinatories and triangulations

Original language description

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.

Czech name

Kombinace a triangulace

Czech description

Tento clanek se zabyva problemem hledani optimalni triangulace pozadovanych vlastnosti. Je zde popsano nekolik metod, ktere resi dany problem "brutalni silou". Ackoliv metody maji NP slozitost, pokousime se urychlit vypocet, jak je to jen mozne, abychom

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2004

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Computational science and its applications - ICCSA 2004

ISBN

3-540-22057-7

ISSN

—

e-ISSN

—

Number of pages

9

Pages from-to

81-89

Publisher name

Springer

Place of publication

Heidelberg

Event location

Assisi

Event date

May 14, 2004

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—