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
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.citation.endPage | 13 | - |
| dc.citation.startPage | 10 | - |
| dc.citation.title | INFORMATION PROCESSING LETTERS | - |
| dc.citation.volume | 149 | - |
| dc.contributor.author | Bhaskara, A. | - |
| dc.contributor.author | Vigneron, Antoine | - |
| dc.date.accessioned | 2023-12-21T18:46:31Z | - |
| dc.date.available | 2023-12-21T18:46:31Z | - |
| dc.date.created | 2019-06-10 | - |
| dc.date.issued | 2019-09 | - |
| dc.description.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. | - |
| dc.identifier.bibliographicCitation | INFORMATION PROCESSING LETTERS, v.149, pp.10 - 13 | - |
| dc.identifier.doi | 10.1016/j.ipl.2019.05.002 | - |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.scopusid | 2-s2.0-85066233196 | - |
| dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/26851 | - |
| dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0020019019300900?via%3Dihub | - |
| dc.identifier.wosid | 000473122300003 | - |
| dc.language | 영어 | - |
| dc.publisher | Elsevier B.V. | - |
| dc.title | Approximating a planar convex set using a sparse grid | - |
| dc.type | Article | - |
| dc.description.isOpenAccess | FALSE | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.type.docType | Article | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordAuthor | Computational geometry | - |
| dc.subject.keywordAuthor | Polygon approximation | - |
| dc.subject.keywordAuthor | Discrepancy | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.