File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Vigneron, Antoine
- Geometric Algorithms Lab.
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Approximating a planar convex set using a sparse grid
- Author(s)
- Bhaskara, A., Vigneron, Antoine
- Issued Date
- 2019-09
- Citation
- INFORMATION PROCESSING LETTERS, v.149, pp.10 - 13
- Abstract
- We show how to construct a set S of O(1/ε1.5) points such that for any convex set C contained in the unit square, the convex hull of the points in S that are contained in C has area at least |C|−ε. We present two algorithmic applications, for geometric shape matching and area approximation.
- Publisher
- Elsevier B.V.
- ISSN
- 0020-0190
- Keyword (Author)
- Computational geometry, Polygon approximation, Discrepancy
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.