Algorithms for Deciding Membership in Polytopes of General Dimension - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Algorithms for Deciding Membership in Polytopes of General Dimension


We study the fundamental problem of polytope membership aiming at large convex polytopes, i.e. in high dimension and with many facets, given as an intersection of halfspaces. Standard data-structures as well as brute force methods cannot scale, due to the curse of dimen- sionality. We design an efficient algorithm, by reduction to the approx- imate Nearest Neighbor (ANN) problem based on the construction of a Voronoi diagram with the polytope being one bounded cell. We thus trade exactness for efficiency so as to obtain complexity bounds polyno- mial in the dimension, by exploiting recent progress in the complexity of ANN search. We employ this algorithm to present a novel boundary data structure based on a Newton-like iterative intersection procedure. We implement our algorithms and compare with brute-force approaches to show that they scale very well as the dimension and number of facets grow larger.
Fichier principal
Vignette du fichier
1804.11295.pdf (1.05 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01897486 , version 1 (19-10-2018)



Evangelos Anagnostopoulos, Ioannis Z. Emiris, Vissarion Fisikopoulos. Algorithms for Deciding Membership in Polytopes of General Dimension. Combinatorial Optimization - 5th International Symposium, ISCO 2018, Apr 2018, Marrakesh, Morocco. ⟨hal-01897486⟩


47 View
140 Download



Gmail Facebook Twitter LinkedIn More