Journal of Algorithms
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Ray shooting and parametric search
SIAM Journal on Computing
An algorithm for approximate closest-point queries
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Separation and approximation of polyhedral objects
Computational Geometry: Theory and Applications
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Separation-sensitive collision detection for convex objects
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Linear programming queries revisited
Proceedings of the sixteenth annual symposium on Computational geometry
Approximation algorithms for convex hulls
Communications of the ACM
Computational Geometry: Theory and Applications
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Journal of Algorithms
Approximate clustering via core-sets
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Closest-point problems simplified on the RAM
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Tutorial on Support Vector Machines for Pattern Recognition
Data Mining and Knowledge Discovery
Algorithms for Polytope Covering and Approximation
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A Replacement for Voronoi Diagrams of Near Linear Size
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A Simple Linear Time (1+ ") -Approximation Algorithm for k-Means Clustering in Any Dimensions
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Building triangulations using ε-nets
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM (JACM)
Faster core-set constructions and data-stream algorithms in fixed dimensions
Computational Geometry: Theory and Applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
A unified approach to approximate proximity searching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Polytope approximation and the Mahler volume
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
We consider an approximate version of a fundamental geometric search problem, polytope membership queries. Given a convex polytope P in REd, presented as the intersection of halfspaces, the objective is to preprocess P so that, given a query point q, it is possible to determine efficiently whether q lies inside P subject to an error bound ε. Previous solutions to this problem were based on straightforward applications of classic polytope approximation techniques by Dudley (1974) and Bentley et al. (1982). The former yields minimum storage, and the latter yields constant query time. A space-time tradeoff can be obtained by interpolating between the two. We present the first significant improvements to this tradeoff. For example, using the same storage as Dudley, we reduce the query time from O(1/ε(d-1)/2) to O(1/ε(d-1)/4). Our approach is based on a very simple algorithm. Both lower bounds and upper bounds on the performance of the algorithm are presented. To establish the relevance of our results, we introduce a reduction from approximate nearest neighbor searching to approximate polytope membership queries. We show that our tradeoff provides significant improvements to the best known space-time tradeoffs for approximate nearest neighbor searching. Furthermore, this is achieved with constructions that are much simpler than existing methods.