77 citations · 207 across the 41 of their papers we have counts for
5 papers · 1 filter
Efficient edge-skeleton computation for polytopes defined by oracles
Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the inpu…
Randomized embeddings with slack, and high-dimensional Approximate Nearest Neighbor
Evangelos Anagnostopoulos, Ioannis Z. Emiris, Ioannis Psarros
The approximate nearest neighbor problem (-ANN) in high dimensional Euclidean space has been mainly addressed by Locality Sensitive Hashing (LSH), which has polynomial dependenc…
Sparse implicitization by interpolation: Geometric computations using matrix representations
Ioannis Emiris, Tatjana Kalinka, Christos Konaxis
Based on the computation of a superset of the implicit support, implicitization of a parametrically given hyper-surface is reduced to computing the nullspace of a numeric matrix. O…
Matrix Methods for Solving Algebraic Systems
Ioannis Z. Emiris
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the m…
Counting Euclidean embeddings of rigid graphs
Ioannis Z. Emiris, Ioannis Psarros
A graph is called (generically) rigid in if, for any choice of sufficiently generic edge lengths, it can be embedded in in a finite number of distinct…