Some Ideas to Test if a Polyhedron is Empty
Optimization and Control
2020-04-28 v1
Authors:
Laurent Truffet
Abstract
In this paper we develop a pure algebraic method which provides an algorithm for testing emptyness of a polyhedron.
Cite
@article{arxiv.2004.12818,
title = {Some Ideas to Test if a Polyhedron is Empty},
author = {Laurent Truffet},
journal= {arXiv preprint arXiv:2004.12818},
year = {2020}
}
Related papers
View all related →
Computational Geometry · Computer Science
Efficient Folding Algorithms for Regular Polyhedra
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
2021-06-01
Computational Geometry · Computer Science
Polyhedron Kernel Computation Using a Geometric Approach
Tommaso Sorgente, Silvia Biasotti, Michela Spagnuolo
2022-02-15
Combinatorics · Mathematics
The polynomial algorithm for graphs' isomorphism testing
Aleksandr Golubchik
2007-05-23
Computational Geometry · Computer Science
A Geometric Approach for Computing the Kernel of a Polyhedron
Tommaso Sorgente, Silvia Biasotti, Michela Spagnuolo
2021-10-28
Computational Geometry · Computer Science
Epsilon-Unfolding Orthogonal Polyhedra
Mirela Damian, Robin Flatland, Joseph O'Rourke
2007-05-23
Artificial Intelligence · Computer Science
Detecting truth, just on parts
Zoltán Kovács, Tomás Recio, M. Pilar Vélez
2018-03-28
Probability · Mathematics
An algorithm to estimate the vertices of a tetrahedron from uniform random points inside
Alina-Daniela Vîlcu, Gabriel-Eduard Vîlcu
2018-08-29
Commutative Algebra · Mathematics
A test for monomial containment
Simon Keicher, Thomas Kremer
2017-04-18
Data Structures and Algorithms · Computer Science
Isomorphism of graphs-a polynomial test
Moshe Schwartz
2007-05-23
Algebraic Geometry · Mathematics
Geometric proofs and algebraic functions
Davide Antonio Nello Maran
2020-05-05
Symbolic Computation · Computer Science
Extensions of the Cylindrical Algebraic Covering Method for Quantifiers
Jasper Nalbach, Gereon Kremer
2025-10-07
Combinatorics · Mathematics
Complementary vertices and adjacency testing in polytopes
Benjamin A. Burton
2012-08-28
Algebraic Geometry · Mathematics
Sparse trace tests
Taylor Brysiewicz, Michael Burr
2022-01-14
Metric Geometry · Mathematics
Hollow polytopes with many vertices
Srinivas Arun, Travis Dillon
2025-04-25
Computational Geometry · Computer Science
On Flat Polyhedra deriving from Alexandrov's Theorem
Joseph O'Rourke
2015-09-10
Computational Geometry · Computer Science
Polygon Convexity: A Minimal O(n) Test
Iosif Pinelis
2007-05-23
Logic in Computer Science · Computer Science
An Emptiness Algorithm for Regular Types with Set Operators
Lunjin Lu, John G. Cleary
2007-05-23
Combinatorics · Mathematics
Generalizations of Total Dual Integrality
Bertrand Guenin, Levent Tunçel
2025-03-12
Optimization and Control · Mathematics
A finite-termination algorithm for testing copositivity over the positive semidefinite cone
Lei Huang, Lingling Xie
2026-01-13
Computational Geometry · Computer Science
A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons
Michael Galetzka, Patrick O. Glauner
2017-07-25
Combinatorics · Mathematics
A New Heuristic for Detecting Non-Hamiltonicity in Cubic Graphs
Jerzy A Filar, Michael Haythorpe, Serguei Rossomakhine
2019-02-28
Symbolic Computation · Computer Science
New Opportunities for the Formal Proof of Computational Real Geometry?
Erika {Á}brahám, James Davenport, Matthew England, Gereon Kremer +1
2021-06-17
Combinatorics · Mathematics
Algebraic Enumeration of Polypolyhedra
George Henderson-Walshe, Michael Langton, Jeanette Claire McLeod, Phillip Lawrence Wilson
2024-10-22
Number Theory · Mathematics
Detecting squarefree numbers
Andrew R. Booker, Ghaith A. Hiary, Jon P. Keating
2015-11-03
Rings and Algebras · Mathematics
Testing isomorphism of complex and real Lie algebras
Tuan A. Nguyen, Vu A. Le, Thieu N. Vo
2021-02-23