Premium
How to name and order convex polyhedra
Author(s) -
Voytekhovsky Yury L.
Publication year - 2016
Publication title -
acta crystallographica section a
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.742
H-Index - 83
ISSN - 2053-2733
DOI - 10.1107/s2053273316010846
Subject(s) - polyhedron , vertex (graph theory) , combinatorics , regular polygon , convex polytope , adjacency list , mathematics , enhanced data rates for gsm evolution , dual polyhedron , adjacency matrix , graph , convex set , computer science , convex optimization , geometry , artificial intelligence
In this paper a method is suggested for naming any convex polyhedron by a numerical code arising from the adjacency matrix of its edge graph. A polyhedron is uniquely fixed by its name and can be built using it. Classes of convex n ‐acra ( i.e . n ‐vertex polyhedra) are strictly ordered by their names.