Pregled bibliografske jedinice broj: 483800
The recursive adjacency decomposition method
The recursive adjacency decomposition method // Seminar of computational homology and applications, National university of Ireland, Galway
Galway, Irska, 2007. (predavanje, međunarodna recenzija, pp prezentacija, znanstveni)
CROSBI ID: 483800 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
The recursive adjacency decomposition method
Autori
Dutour Sikirić, Mathieu
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, pp prezentacija, znanstveni
Izvornik
Seminar of computational homology and applications, National university of Ireland, Galway
/ - , 2007
Skup
Seminar of computational homology and applications, National university of Ireland, Galway
Mjesto i datum
Galway, Irska, 19.09.2007
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
polyhedral computation; group; enumeration
Sažetak
A polytope P is the convex hull of a finite number of vertices. A polytope has a face lattice structure with the facets being the maximal elements. The representation conversion problem consist of obtaining the facets of P from the vertices of P and vice versa. The complexity of this, and other related problems will be discussed with a view towards practical work on computer. The representation conversion problem is sometimes impossible to solve by existing program. But the polytopes might have a large symmetry group, which we want to use. We will show how this can be done with the recursive adjacency decomposition method. Then, I will explain the implementation, some case study, other methods and similar problems where symmetry is useful.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
