Two variations of graph test in double description method
From MaRDI portal
Publication:2322740
DOI10.1007/s40314-019-0862-0zbMath1463.68138OpenAlexW2945396231MaRDI QIDQ2322740
Sergei I. Bastrakov, Nikolai Yu. Zolotykh
Publication date: 5 September 2019
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-019-0862-0
convex hullconvex polyhedronpolyhedral conevertex enumerationdouble description methodfacet enumeration
Applications of graph theory (05C90) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing generating sets of lattice ideals and Markov bases of lattices
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Primal-dual methods for vertex and facet enumeration
- How good are convex hull algorithms?
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
- Computing convex hulls and counting integer points with \texttt{polymake}
- New modification of the double description method for constructing the skeleton of a polyhedral cone
- Über homogene lineare Ungleichungssysteme
- Lectures on Polytopes
- The quickhull algorithm for convex hulls
- A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
- Exploring the Dynamic Buchberger Algorithm
- Algorithm for finding a general formula for the non-negative solutions of a system of linear equations
- Introduction to global optimization.
