The lexico-smallest representation of convex polyhedra
Publications associées (52)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Many recent works have shown that if a given signal admits a sufficiently sparse representation in a given dictionary, then this representation is recovered by several standard optimization algorithms, in particular the convex ℓ1 minimization approac ...
Spheropolyhedra are bodies obtained as Minkowski sums of polyhedra with spheres. They are simple, yet flexible models of non-spherical particles for granular media simulated with the Distinct Element Method (DEM). We here give an analytical method for the ...
We investigate the diameter of a natural abstraction of the 1-skeleton of polyhedra. Even if this abstraction is more general than other abstractions previously studied in the literature, known upper bounds on the diameter of polyhedra continue to hold her ...
We investigate the diameter of a natural abstraction of the 1-skeleton of polyhedra. Although this abstraction is simpler than other abstractions that were previously studied in the literature, the best upper bounds on the diameter of polyhedra continue to ...
Batch control has traditionally addressed the problems related to the absence of a steady state and the finite batch duration. Recently, batch control has added the dimension that arises naturally from the possibility of applying run-to-run control, i.e. i ...
In this note, the representations of extremal Dirichlet and logistic distributions are reviewed and extended. These new representations allow exact simulations of the spectral distribution functions and an extension of the extremal logistic case to dimensi ...
Suppose d > 2, n > d+1, and we have a set P of n points in d-dimensional Euclidean space. Then P contains a subset Q of d points such that for any p ∈ P, the convex hull of Q∪{p} does not contain the origin in its interior.We also show that for non-emp ...
A framework is introduced for the study of general Radon shape diffusions, that is, shape diffusions induced by projections of randomly rotating shapes. This is done via a convenient representation of unoriented Radon shape diffusions in (unoriented) D.G. ...
The mathematical facet of modern crystallography is essentially based on analytical geometry, linear algebra as well as group theory. This study endeavours to approach the geometry and symmetry of crystals using the tools furnished by differential geometry ...
We study the boson peak phenomenology experimentally observed in globular proteins by means of elastic network models. These models are suitable for an analytic treatment in the framework of Euclidean random matrix theory, whose predictions can be numerica ...