Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | LEE, HS | en_US |
dc.contributor.author | CHANG, RC | en_US |
dc.date.accessioned | 2014-12-08T15:05:02Z | - |
dc.date.available | 2014-12-08T15:05:02Z | - |
dc.date.issued | 1992 | en_US |
dc.identifier.issn | 0302-9743 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/3557 | - |
dc.description.abstract | In this paper, we consider the problem of approximating a vertex of a convex polygon by an integer point in the polygon. We show that the nearest grid point in a convex polygon to a vertex can be found if it exists, or decided to be nonexistent, in time O(n + logl), where l is the diameter of the polygon and a is the number of the polygon's vertices. The underlying technique used in the continued fraction expansion. | en_US |
dc.language.iso | en_US | en_US |
dc.title | APPROXIMATING VERTICES OF A CONVEX POLYGON WITH GRID POINTS IN THE POLYGON | en_US |
dc.type | Article | en_US |
dc.identifier.journal | LECTURE NOTES IN COMPUTER SCIENCE | en_US |
dc.citation.volume | 650 | en_US |
dc.citation.spage | 269 | en_US |
dc.citation.epage | 278 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:A1992LF70500029 | - |
dc.citation.woscount | 0 | - |
Appears in Collections: | Articles |