The following pages link to (Q3010463):
Displaying 50 items.
- Space exploration via proximity search (Q312150) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions (Q670709) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- Routing on heavy-path WSPD-spanners (Q832910) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- Robust proximity search for balls using sublinear space (Q1702130) (← links)
- Approximation algorithms for color spanning diameter (Q1708269) (← links)
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity (Q1731460) (← links)
- Polynomial-sized topological approximations using the permutahedron (Q1739197) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Influence-based Voronoi diagrams of clusters (Q1984607) (← links)
- On separating points by lines (Q1985301) (← links)
- Partition of unity methods for signal processing on graphs (Q2048685) (← links)
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- Optimal approximations made easy (Q2122796) (← links)
- Subset selection for multiple linear regression via optimization (Q2182858) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- Unsupervised assignment flow: label learning on feature manifolds by spatially regularized geometric assignment (Q2203373) (← links)
- Approximate range closest-pair queries (Q2206740) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Sparse convex hull coverage (Q2230408) (← links)
- Window queries for intersecting objects, maximal points and approximations using coresets (Q2235286) (← links)
- Conic nearest neighbor queries and approximate Voronoi diagrams (Q2261577) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Minimum perimeter-sum partitions in the plane (Q2291459) (← links)
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
- A faster algorithm for truth discovery via range cover (Q2324248) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) (← links)
- On the complexity of randomly weighted multiplicative Voronoi diagrams (Q2349856) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
- The VC dimension of metric balls under Fréchet and Hausdorff distances (Q2665263) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable (Q2679994) (← links)
- Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand (Q2806071) (← links)
- Adaptive Atlas of Connectivity Maps (Q2945978) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- Assignment Flows (Q3300540) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q3304732) (← links)
- Approximating Nearest Neighbor Distances (Q3449817) (← links)
- A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations (Q3452821) (← links)
- Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)