Uniformity of Point Samples in Metric Spaces Using Gap Ratio
From MaRDI portal
Publication:5361233
DOI10.1137/15M1051300zbMath1375.52022OpenAlexW2758469021MaRDI QIDQ5361233
Sameer Desai, Mayank Goswami, Arijit Ghosh, Arijit Bishnu, Subhabrata Paul
Publication date: 27 September 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1051300
coveringapproximationmetric spacepackinglower boundsDelaunay triangulationhardnessgap ratiouniformity measure
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete geometry (52C99) Discrete mathematics in relation to computer science (68R99)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical measures of two dimensional point set uniformity
- Computational approaches to lattice packing and covering problems
- Online uniformity of integer points on a line
- Clustering to minimize the maximum intercluster distance
- Generalized domination and efficient domination in graphs
- Density of an \((r,R)\)-system
- A special planar satisfiability problem and a consequence of its NP- completeness
- 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
- Covering a rectangle with six and seven circles
- A lower bound for the discrepancy of a random point set
- On lower bounds for the \(L_2\)-discrepancy
- Mesh ratios for best-packing and limits of minimal energy configurations
- Disk Packing in a Square: A New Global Optimization Approach
- Delaunay Mesh Generation
- Approximating extent measures of points
- On coresets for k-means and k-median clustering
- 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
- An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
