COVERING GRID POINTS IN A CONVEX POLYGON WITH STRAIGHT-LINES

被引：0
|
作者：
LEE, HS
CHANG, RC
机构：
[1] NATL CHIAO TUNG UNIV,INST COMP & INFORMAT SCI,HSINCHU 30050,TAIWAN
[2] NATL CHIAO TUNG UNIV,INST COMP SCI & INFORMAT ENGN,HSINCHU 30050,TAIWAN
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1992年 / 42卷 / 3-4期
关键词：
APPROXIMATION ALGORITHM; CONTINUED FRACTION EXPANSIONS; HITTING SET PROBLEM; NUMBER THEORY;
D O I：
10.1080/00207169208804057
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider the following problem: Find a set of parallel straight lines with equal spacing to hit all m grid points in a closed region bounded by a convex polygon P with n vertices such that size of this set is minimal. We use continued fraction expansions to explore the combinatorial properties of this problem and propose an O(n + log m) approximation algorithm which guarantees finite performance ratio.
引用
收藏
页码：137 / 156
页数：20
相关论文
共 50 条
12345