D. Mount

activity

20142023

most citedOptimal Approximate Polytope Membership

8 citations · 34 across the 13 of their papers we have counts for

collaborators

Showing 2016 · cs.CGShow all

3 papers · 2 filters

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 $K$ in $R^{d}$ is given, and the objective is to preprocess $K$ into a data structure so that, given a query point $q \in R^{d}$ ,…

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 $K$ in $R^{d}$ is given, and the objective is to preprocess $K$ 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 $K$ of diameter $diam (K)$ is given in Euclidean $d$ …