APPROXIMATING VERTICES OF A CONVEX POLYGON WITH GRID POINTS IN THE POLYGON

被引:0
|
作者
LEE, HS [1 ]
CHANG, RC [1 ]
机构
[1] NATL CHIAO TUNG UNIV, INST COMP & INFORMAT SCI, HSINCHU 30050, TAIWAN
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:269 / 278
页数:10
相关论文
共 50 条