Approximate polytope membership queries
From MaRDI portal
Publication:5419128
DOI10.1145/1993636.1993713zbMath1288.68219arXiv1604.01183MaRDI 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
52B11: (n)-dimensional polytopes
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W25: Approximation algorithms
Related Items
Approximate Polytope Membership Queries, Simplex Range Searching and Its Variants: A Review, Economical Delone Sets for Approximating Convex Bodies, Unnamed Item, On the combinatorial complexity of approximating polytopes, Conic nearest neighbor queries and approximate Voronoi diagrams