Vol. 3, No. 1, 2010

Download this article
Download this article For screen
For printing
Recent Issues

Volume 10
Issue 3, 361–539
Issue 2, 181–360
Issue 1, 1–180

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
Cover Page
Editorial Board
Editors’ Addresses
Editors’ Interests
About the Journal
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Editorial Login
Author Index
Coming Soon
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Weakly viewing lattice points

Neil R. Nicholson and R. Christopher Sharp

Vol. 3 (2010), No. 1, 9–16

A specific rectangular array of lattice points is investigated. We say that the array is weakly visible from a lattice point not in the array if no point in the array lies on the line connecting the external point to any other point in the array. A lower bound is found for the distance from a weakly viewing point to the array, and a point of minimal distance is determined for arrays of a specific size. A secondary type of visibility is also discussed, and a closest point viewing the array in this style is completely determined.

weak visibility, lattice point
Mathematical Subject Classification 2000
Primary: 11H06
Received: 12 March 2009
Accepted: 8 March 2010
Published: 20 April 2010

Communicated by Gaven J. Martin
Neil R. Nicholson
William Jewell College
500 College Hill, Box 1107
Liberty, MO 64068
United States
R. Christopher Sharp
Department of Mathematics
University of Kansas
405 Snow Hall
1460 Jayhawk Boulevard
Lawrence, KS 66045
United States