covering grid points in a convex polygon with straight linesFootnote^∗

^∗ This research work was partially supported by the National Science Council of the Republic of China under grant No. NSC80-0408-E009-03. To whom all the correspondence should be sent.

References

• Garey , M.R. and Johnson , D.S. 1979 . “ Computers and Intractability ” . In A Guide to the Theory of NP- Completeness , San Francisco, California : Fremman .
   Google Scholar
• Greene , D.H. and Yao , F.F. . Finite-resolution computational geometry . Proc. 27th Symposium on Foundations of Computer Science . pp. 143 – 152 .
   Google Scholar
• Hassin , R. and Megiddo , N. 1991 . Approximation algorithms for hitting objects with straight lines . Discrete Applied Mathematics , 30 ( 1 ) : 29 – 24 .
   Web of Science ®Google Scholar
• Knuth , D.E. 1981 . The Art of Computer Programming , Addison-Wesley . second edition
   Google Scholar
• Lee , H.S. and Chang , R.C. 1991 . Weber problem on a grid Techn. Rep., Dept. of Comp. Science and Info. Engineering, NCTU
   Google Scholar
• LeVeque , W.J. 1977 . Fundamentals of Number Theory , Addison-Wesley .
   Google Scholar
• Lovasz , L. 1986 . “ Society for Industrial and Applied Mathematics ” . In An Algorithmic Theory of Numbers, Graphs and Complexity Pennsylvania
   Google Scholar
• Mehta , S. , Mukherjeel , M. and Nagy , G. . Constrained integer approximation to 2-D line intersections . Second Canadian Conf on Computational Geometry . August , pp. 302 – 305 . Canada
   Google Scholar
• Overmars , M.H. 1988 . “ Computational geometry on a grid: an overview ” . In Theoretical Foundations for Computer Graphics and CAD , 167 – 184 . Berlin : Springer-Verlag .
   Google Scholar
• Preparata , F.P. and Shamos , M.I. 1985 . Computational Geometry:An Introduction , New York : Springer-Verlag .
   Google Scholar