Pregled bibliografske jedinice broj: 483643
The recursive adjacency decomposition method
The recursive adjacency decomposition method // CRM conference on polyhedral computations
Montréal, Kanada, 2006. (plenarno, međunarodna recenzija, pp prezentacija, znanstveni)
CROSBI ID: 483643 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
CRM conference on polyhedral computations
/ - , 2006
Skup
CRM conference on polyhedral computations
Mjesto i datum
Montréal, Kanada, 23.10.2006. - 26.10.2006
Vrsta sudjelovanja
Plenarno
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
polyhedral computation; group; enumeration
Sažetak
The Adjacency Decomposition Method is a classical technique for finding the orbits of facets or vertices of a symmetric polytope by a graph traversal algorithm. However, some orbits might be difficult to treat, i.e. their dual description is difficult. The recursive Adjacency method is simply to extend the original algorithm to those orbits. I will explain how this method has been implemented. Then, I will show some case studies of the method: the perfect domain of E8, the Delaunay polytopes of the Coxeter lattices and the Contact Polytope of O23.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
