Results 11 to 20 of about 181 (122)
The Numbers of Faces of Polytope Pairs and Unbounded Polyhedra
European Journal of Combinatorics, 1981 Klee in 1966 proved that every simple d-polyhedron P with v facets has at least v−d+1 vertices. Grünbaum speculated whether this result might be improved upon if one specified both the number of bounded and of unbounded facets of P. In 1974 Klee approached problems of this form from the point of view of pairs of simple polytopes while investigating the
Louis J. Billera, Carl W. Lee
openalex +3 more sources
Review: Form of Space: Polygons, Polyhedra and Polytopes
, 1984 A graphic adventure in two-, three- and four-dimensional fantastic worlds is undertaken in this book, using polygons (or 2-polytopes), polyhedra (or 3-polytopes), and polytopes (or Cpolytopes). The topics extend over many epochs and countries, with particular emphasis on the past in Japan.
Koji Miyazaki
openalex +3 more sources
Formalizing the Face Lattice of Polyhedra [PDF]
Logical Methods in Computer Science, 2022 Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq.
Xavier Allamigeon +2 more
doaj +1 more source
A State of the Art Review of Systems of Linear Inequalities and Related Observability Problems
Algorithms, 2023 This work is a short review of the state of the art aiming to contribute to the use, disclosure, and propagation of systems of linear inequalities in real life, teaching, and research.
Enrique Castillo
doaj +1 more source
Optimization of Packing Irregular Three-Dimensional Objects
Кібернетика та комп'ютерні технології, 2023 Introduction. Nowadays the irregular packing problem is becoming more important, since effective space management and optimal arrangement of objects are becoming key factors for ensuring efficiency and saving resources in a wide range of applications, e ...
Tetyana Romanova +4 more
doaj +1 more source
Resistor Networks based on Symmetrical Polytopes
Electronic Journal of Graph Theory and Applications, 2015 This paper shows how a method developed by Van Steenwijk can be generalized to calculate the resistance between any two vertices of a symmetrical polytope all of whose edges are identical resistors.
Jeremy Moody, P.K. Aravind
doaj +1 more source
Considerations regarding the representation of the invisible: Monge’s method in four dimensions
EGA, 2019 The graphic representation of fourdimensional space, between the nineteenth and twentieth centuries, deserves a prominent place in the history of graphic thinking.
Andrés Martín Pastor +1 more
doaj +1 more source
SYSTEMATICS OF COINCIDENCE SITE LATTICES OF CRYSTALS
Конденсированные среды и межфазные границы, 2018 . The object of this study is polycrystalline materials containing intercrystalline boundaries as one of the accompanying components of the defective structure. A wide variety of geometric characteristics that determine the atomic structure and physical
Boris M. Darinskiy +2 more
doaj +1 more source
Risk‐aware safe reinforcement learning for control of stochastic linear systems
Asian Journal of Control, EarlyView.Abstract This paper presents a risk‐aware safe reinforcement learning (RL) control design for stochastic discrete‐time linear systems. Rather than using a safety certifier to myopically intervene with the RL controller, a risk‐informed safe controller is also learned besides the RL controller, and the RL and safe controllers are combined together ...
Babak Esmaeili +2 more
wiley +1 more source