Fourier algorithm revisited

DOI10.1007/3-540-53162-9_34zbMath1493.68401OpenAlexW1495902998MaRDI QIDQ5096191

Tien Huynh, Jean-Louis Lassez, Catherine Lassez

Publication date: 16 August 2022

Published in: Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53162-9_34

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Affine analytic geometry (51N10)

Related Items (2)

Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling ⋮ On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases

Cites Work

• On the structure of the set bases of a degenerate point
• Degeneracy graphs and the neighbourhood problem
• Fourier-Motzkin elimination and its dual
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• An algorithm for determining all extreme points of a convex polytope

This page was built for publication: Fourier algorithm revisited