scientific article
From MaRDI portal
Publication:3010463
zbMath1230.68215MaRDI QIDQ3010463
Publication date: 4 July 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Approximation algorithms (68W25) Combinatorial complexity of geometric structures (52C45)
Related Items (93)
Optimal approximations made easy ⋮ On Locality-Sensitive Orderings and Their Applications ⋮ Routing on heavy-path WSPD-spanners ⋮ Approximating Nearest Neighbor Distances ⋮ A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations ⋮ Space exploration via proximity search ⋮ From proximity to utility: a Voronoi partition of Pareto optima ⋮ Unnamed Item ⋮ Computing the Rectilinear Center of Uncertain Points in the Plane ⋮ Journey to the Center of the Point Set ⋮ The VC dimension of metric balls under Fréchet and Hausdorff distances ⋮ Approximating maximum diameter-bounded subgraph in unit disk graphs ⋮ Intrinsic Dimension Adaptive Partitioning for Kernel Methods ⋮ Nearest-neighbor searching under uncertainty. I ⋮ Spanners for Directed Transmission Graphs ⋮ Adaptive Atlas of Connectivity Maps ⋮ Subset selection for multiple linear regression via optimization ⋮ A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ A note on stabbing convex bodies with points, lines, and flats ⋮ Improved bounds for the expected number of \(k\)-sets ⋮ Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location ⋮ On the combinatorial complexity of approximating polytopes ⋮ Geometric Packing under Nonuniform Constraints ⋮ Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable ⋮ Clustering with faulty centers ⋮ Quasi-uniform designs with optimal and near-optimal uniformity constant ⋮ An algorithmic framework for the single source shortest path problem with applications to disk graphs ⋮ Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance ⋮ Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ Dynamic connectivity in disk graphs ⋮ Scaling by subsampling for big data, with applications to statistical learning ⋮ Approximate Polytope Membership Queries ⋮ Approximating length-restricted means under dynamic time warping ⋮ Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon ⋮ Online Spanners in Metric Spaces ⋮ Robust proximity search for balls using sublinear space ⋮ Unsupervised assignment flow: label learning on feature manifolds by spatially regularized geometric assignment ⋮ Approximate range closest-pair queries ⋮ Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications ⋮ Approximation algorithms for color spanning diameter ⋮ Unnamed Item ⋮ \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity ⋮ Self-Assignment Flows for Unsupervised Data Labeling on Graphs ⋮ Sparse convex hull coverage ⋮ Assignment Flows ⋮ Light Euclidean Spanners with Steiner Points ⋮ Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions ⋮ Polynomial-sized topological approximations using the permutahedron ⋮ On Locality-Sensitive Orderings and Their Applications ⋮ Window queries for intersecting objects, maximal points and approximations using coresets ⋮ Influence-based Voronoi diagrams of clusters ⋮ On separating points by lines ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond ⋮ Approximating the maximum overlap of polygons under translation ⋮ Fast local searches and updates in bounded universes ⋮ A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension ⋮ The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata ⋮ Conic nearest neighbor queries and approximate Voronoi diagrams ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two proofs for shallow packings ⋮ Near-linear algorithms for geometric hitting sets and set covers ⋮ Minimum perimeter-sum partitions in the plane ⋮ Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand ⋮ Sparse Approximation via Generating Point Sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Partition of unity methods for signal processing on graphs ⋮ Unnamed Item ⋮ Preprocessing Ambiguous Imprecise Points ⋮ Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time ⋮ Approximating Distance Measures for the Skyline ⋮ Unnamed Item ⋮ Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications ⋮ A faster algorithm for truth discovery via range cover ⋮ Faster algorithms for growing prioritized disks and rectangles ⋮ Dynamic smooth compressed quadtrees ⋮ Approximating Minimization Diagrams and Generalized Proximity Search ⋮ Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces ⋮ Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points ⋮ Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs ⋮ Approximate Range Queries for Clustering ⋮ Metric Spaces with Expensive Distances ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal Algorithms for Geometric Centers and Depth ⋮ On the complexity of randomly weighted multiplicative Voronoi diagrams ⋮ Approximation algorithm for minimum partial multi-cover under a geometric setting
Uses Software
This page was built for publication:
