Add to ORKGThe combinatorial and geometric realization of polytopes are outlined in mathematical and computational terminology. With these two representations in hand, various parametric forms may be constructed using vertex locations, edge angles, and symbolic values. We have implemented software which represents polytopes in a way useful for combinatorial inspection and solid modeling using the Julia programming language. These packages have been published to GitHub and are accessible to mathematical researchers around the world through the Julia package manager
This thesis is concerned with the design of a polyhedron enumeration algorithm. The approach taken f...
International audienceTiling is a crucial program transformation, adjusting the ops-to-bytes balance...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...
The abstract domain of polyhedra lies at the heart of many program analysis techniques. However, its...
The graph of a polytope is the graph whose vertex set is the set of vertices of the polytope, and wh...
2014 Spring.Numerical Algebraic Geometry (NAG) has recently seen significantly increased application...
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and alg...
International audiencePolyhedral projection is a main operation of the polyhedron abstract domain.It...
International audienceConvex polyhedra are commonly used in the static analysis of programs to repre...
Polyhedral compilation is widely used in high-level synthesis tools and in production compilers such...
Many compiler optimization techniques depend on the ability to calculate the number of integer value...
A mathematical model based on polyhedra (the so-called “polyhedron model”) serves as a foundation fo...
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for...
Polyhedral operations play a central role in constrained control. One of the most fundamental operat...
Parameterized linear systems allow for modelling and reasoning over classes of polyhedra. Collectio...
This thesis is concerned with the design of a polyhedron enumeration algorithm. The approach taken f...
International audienceTiling is a crucial program transformation, adjusting the ops-to-bytes balance...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...
The abstract domain of polyhedra lies at the heart of many program analysis techniques. However, its...
The graph of a polytope is the graph whose vertex set is the set of vertices of the polytope, and wh...
2014 Spring.Numerical Algebraic Geometry (NAG) has recently seen significantly increased application...
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and alg...
International audiencePolyhedral projection is a main operation of the polyhedron abstract domain.It...
International audienceConvex polyhedra are commonly used in the static analysis of programs to repre...
Polyhedral compilation is widely used in high-level synthesis tools and in production compilers such...
Many compiler optimization techniques depend on the ability to calculate the number of integer value...
A mathematical model based on polyhedra (the so-called “polyhedron model”) serves as a foundation fo...
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for...
Polyhedral operations play a central role in constrained control. One of the most fundamental operat...
Parameterized linear systems allow for modelling and reasoning over classes of polyhedra. Collectio...
This thesis is concerned with the design of a polyhedron enumeration algorithm. The approach taken f...
International audienceTiling is a crucial program transformation, adjusting the ops-to-bytes balance...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...