8 citations · 32 across the 12 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.CG2016★ 8 cited
Optimal Approximate Polytope Membership
Sunil Arya, Guilherme D. da Fonseca, David M. Mount
In the polytope membership problem, a convex polytope in is given, and the objective is to preprocess into a data structure so that, given a query point ,…
cs.CG2016★ 2 cited
Approximate Polytope Membership Queries
Sunil Arya, Guilherme D. da Fonseca, David M. Mount
In the polytope membership problem, a convex polytope in is given, and the objective is to preprocess into a data structure so that, given any query point $q…
cs.CG2016★ 8 cited
On the Combinatorial Complexity of Approximating Polytopes
Sunil Arya, Guilherme D. da Fonseca, David M. Mount
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body of diameter is given in Euclidean …