Uniformity of point samples in metric spaces using gap ratio

DOI10.1137/15M1051300MaRDI QIDQ5361233zbMATH OpenOpenAlexFDO

Authors Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, S. 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

zbMATH Keywords

approximationcoveringDelaunay triangulationgap ratiohardnesslower boundsmetric spacepackinguniformity measure

Mathematics Subject Classification ID

Discrete geometry (52C99) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Uniformity of point samples in metric spaces using gap ratio
• Online uniformity of integer points on a line
• Online uniformly inserting points on the sphere
• Bounds for L_p-discrepancies of point distributions in compact metric measure spaces
• Point distributions in compact metric spaces

Cites work

• A circle packing algorithm
• A lower bound for the discrepancy of a random point set
• A special planar satisfiability problem and a consequence of its NP- completeness
• An inequality linking packing and covering densities of plane convex bodies
• An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
• Approximating extent measures of points.
• Asymptotic Behavior of Optimal Circle Packings in a Square
• Clustering to minimize the maximum intercluster distance
• Computational approaches to lattice packing and covering problems
• Computational geometry. Algorithms and applications.
• Covering a rectangle with six and seven circles
• Data streams: algorithms and applications.
• Delaunay mesh generation.
• Density of an \((r,R)\)-system
• Disk packing in a square: a new global optimization approach
• Generalized domination and efficient domination in graphs
• Geometric discrepancy. An illustrated guide
• scientific article; zbMATH DE number 3846365 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256715 (Why is no real title available?)
• scientific article; zbMATH DE number 1958099 (Why is no real title available?)
• scientific article; zbMATH DE number 1958114 (Why is no real title available?)
• scientific article; zbMATH DE number 1528185 (Why is no real title available?)
• scientific article; zbMATH DE number 1559578 (Why is no real title available?)
• Matrix Rounding under the L_p-Discrepancy Measure and Its Application to Digital Halftoning
• Mesh ratios for best-packing and limits of minimal energy configurations
• More optimal packings of equal circles in a square
• On coresets for k-means and k-median clustering
• On lower bounds for the \(L_2\)-discrepancy
• On-line uniformity of points
• Online uniformity of integer points on a line
• Packing equal circles in a square: A deterministic global optimization approach
• Packing up to 50 equal circles in a square
• Statistical measures of two dimensional point set uniformity
• Systems of distant representatives
• The weighted perfect domination problem and its variants
• Uniformly inserting points on square grid

Cited in

(3)

• Online uniformly inserting points on the sphere
• Uniformity of point samples in metric spaces using gap ratio
• Statistical measures of two dimensional point set uniformity

This page was built for publication: Uniformity of point samples in metric spaces using gap ratio

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361233)