Coreset
From Wikipedia, the free encyclopedia
A coreset (in computational geometry) is a small subset of a point set that is used to compute a solution that approximates the solution that would be found if the entire point set were used.[1]
References [edit]
- ^ Pankaj K. Agarwal, Sariel Har-Peled, and Kasturti R. Varadarajan (2005-02-22). Geometric Approximation via Coresets (PDF PS). Retrieved 2007-03-29.
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
