Approximate polytope membership queries

DOI10.1145/1993636.1993713zbMath1288.68219arXiv1604.01183OpenAlexW2152564789MaRDI QIDQ5419128

David M. Mount, Sunil Arya, Guilherme Dias da Fonseca

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.01183

zbMATH Keywords

nearest neighbor searchingspace-time tradeoffspolytope membership

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (6)

On the combinatorial complexity of approximating polytopes ⋮ Approximate Polytope Membership Queries ⋮ Simplex Range Searching and Its Variants: A Review ⋮ Conic nearest neighbor queries and approximate Voronoi diagrams ⋮ Economical Delone Sets for Approximating Convex Bodies ⋮ Unnamed Item

This page was built for publication: Approximate polytope membership queries