A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Helly-Type Theorems in Property Testing
[chapter]

2014
*
Lecture Notes in Computer Science
*

Helly's theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If S is a set of n points in R d , we say that S is (k, G)-clusterable if it can be partitioned into k clusters (subsets) such that each cluster can be contained in a translated copy of a geometric object G. In this paper, as an application of Helly's theorem, by taking a constant size sample from S, we present a testing algorithm for (k, G)clustering, i.e., to

doi:10.1007/978-3-642-54423-1_27
fatcat:zjpkcacguveh7hvsa55jlicbcy