Helly-Type Theorems in Property Testing

DOI10.1142/S0218195918500115zbMath1426.52001OpenAlexW1788065650MaRDI QIDQ4631011

Sasanka Roy, Sourav Chakraborty, Rameshwar Pratap, Shubhangi Saraf

Publication date: 24 April 2019

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195918500115

zbMATH Keywords

clusteringdiscrete geometryHelly's theoremproperty testing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Helly-type theorems and geometric transversal theory (52A35)

Uses Software

• clusfind

Cites Work

• The planar \(k\)-means problem is NP-hard
• Intersection patterns of convex sets
• Intersection properties of boxes in \(R^ n\).
• A simple proof of the upper bound theorem
• An upper-bound theorem for families of convex sets
• Property testing and its connection to learning and approximation
• The Weighted Euclidean 1-Center Problem
• A Problem of Geometry in R n
• Finding Groups in Data
• Testing of Clustering
• On a conjecture of Danzer and Grünbaum
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Helly-Type Theorems in Property Testing