Cited By
View all- Kranakis EPocchiola M(1994)Camera placement in integer latticesDiscrete & Computational Geometry10.1007/BF0257436812:1(91-104)Online publication date: 1-Dec-1994
Enumeration and visibility problems in integer lattices (extended abstract)
Pages 261 - 270
Abstract
We study enumeration and visibility problems in the d-dimensional integer lattice Ldn of d-tuples of integers ≤ n. In the first part of the paper we give several useful enumeration principles and use them to study the asymptotic behavior of the number of straight lines traversing a certain fixed number of lattice vertices of Ldn, the line incidence problem and the edge visibility region. In the second part of the paper we consider an art gallery problem for point obstacles. More specifically we study the camera placement problem for the infinite lattice Ld. A lattice point is visible from a camera C (positioned at a vertex of Ld) if the line segment joining A and C crosses no other lattice vertex. For any given number s ≤ 3d of cameras we determine the position they must occupy in the lattice Ld in order to maximize their visibility.
References
[1]
H.L. Abbott. Some results in combinatorial geometry. Discrete Mathematics, 9:199-204, 1974.
[2]
T.M. Apostol. Introduction to Analytic Number Theory. Springer Verlag, 1976.
[3]
Y.D. Burago and V. A. Zalgaller. Geometric Inequalities. Springer Verlag, 1988. Translated from the Russian.
[4]
K. L. Clarkson, H. Edelsbrunner, L. J. Guibas, M. Sharir, and E. Wezl. Combinatorial Complexity Bounds and Arrangements of Curves and Surfaces. Technical Report R88/1470, University of Illinois at Urbana-Champaign, November 1988.
[5]
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.
[6]
P. Erd5s. On the integers relatively prime to n and on a number theoretic function considered by Jacobsthal. Math. Scand., 10:163- 170, 1962.
[7]
F. Herzog and B. M. Stewart. Patterns of visible and nonvisible lattice points. American Mathematical Monthly, 78:487- 496, 1971.
[8]
G.H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford Science Publications, 1979. 355 pages.
[9]
M. Kac. Statistical Independence in Probability, Analysis and Number Theory. Volume 12 of The Carus Mathematical Monographs, Mathematical Association of America, 1959.
[10]
D. Knuth. The Art of Computer Program. ruing: Seminumerical Algorithms. Computer Science and information Processing, Addison Wesley, second edition, 1981. 688 pages.
[11]
E. Kranakis and M. Pocchiola. Enumeration and Visibility Problems in integer lattices. Technical Report 13, LIENS, December 1989.
[12]
E. Kranakis and M. Pocchiola. Visibility in integer lattices. 1990. In preparation.
[13]
W.O.J. Moser. Problems on extremal properties of a finite set of points. In Goodman et al, editor, New York Academy o.f Sciences, pages 52 - 64, 1985.
[14]
W. Narldewicz. Number Theory. World Scientific, second edition, 1983. 371 pages.
[15]
M. Nosarzewska. Evaluation de la difference entre l'aire d'une r~gion plane convexe et le nombre des points aux coordonn~es enti~res couverts par elle. Colloq. Math., 1, 1948.
[16]
J. O'Rourke. Art Gallery Theorems and Algorithms. International Series of Monographs on Computer Science, Oxford University Press, 1987. 282 pages.
[17]
H. Rademacher. Lectures on Elementary Number Theory. Blaisdell, New York, 1964.
[18]
D.F. Rearick. Ph.D. Thesis, California Institute of Technology, 1960.
[19]
H. Rumsey Jr. Sets of visible points. Duke Mathematical Journal, 33:263-274, 1966.
[20]
S. Suri and J. O'Rourke. Worst-case optimal algorithms for constructing visibility polygons with holes. In Proceedings of the Y?nd Annual A CM Symposium on Computational Geometry, 1986.
[21]
E. Szemer~di and W. Trotter Jr. Extremal problems in discrete geometry. Combinatorica, 3:381-392, 1983.
Index Terms
- Enumeration and visibility problems in integer lattices (extended abstract)
Recommendations
Integrally Closed Residuated Lattices
AbstractA residuated lattice is said to be integrally closed if it satisfies the quasiequations and , or equivalently, the equations and . Every integral, cancellative, or divisible residuated lattice is integrally closed,...
On Gelfand residuated lattices
AbstractIn this paper, a combination of algebraic and topological methods is applied to obtain new and structural results on Gelfand residuated lattices. It is demonstrated that Gelfand’s residuated lattices strongly tied up with the hull–kernel topology. ...
Comments
Information & Contributors
Information
Published In
Copyright © 1990 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 May 1990
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 625 of 1,685 submissions, 37%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 64Total Downloads
- Downloads (Last 12 months)35
- Downloads (Last 6 weeks)4
Reflects downloads up to 02 Sep 2024
Other Metrics
Citations
Cited By
View all- Kranakis EPocchiola M(1994)Camera placement in integer latticesDiscrete & Computational Geometry10.1007/BF0257436812:1(91-104)Online publication date: 1-Dec-1994
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in