Uniformity of Point Samples in Metric Spaces Using Gap Ratio
From MaRDI portal
Publication:2948479
DOI10.1007/978-3-319-17142-5_30zbMath1460.68078arXiv1411.7819OpenAlexW1536470053MaRDI QIDQ2948479
Subhabrata Paul, Mayank Goswami, Sameer Desai, Arijit Ghosh, Arijit Bishnu
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.7819
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Metric embeddings as related to computational problems and algorithms (68R12)
Related Items (2)
Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Online Inserting Points Uniformly on the Sphere
Cites Work
- Online uniformity of integer points on a line
- Clustering to minimize the maximum intercluster distance
- Generalized domination and efficient domination in graphs
- Packing up to 50 equal circles in a square
- Packing equal circles in a square: A deterministic global optimization approach
- Systems of distant representatives
- More optimal packings of equal circles in a square
- An inequality linking packing and covering densities of plane convex bodies
- A circle packing algorithm
- The weighted perfect domination problem and its variants
- Uniformly inserting points on square grid
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio
- Asymptotic Behavior of Optimal Circle Packings in a Square
- Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning
- Geometric discrepancy. An illustrated guide
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Uniformity of Point Samples in Metric Spaces Using Gap Ratio
