Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
integer grid
Description:
A discrete geometric lattice whose points have integer coordinates, used in combinatorics, geometry, and algorithm design.
Related topics:
Computational Geometry and Mesh Generation (19%),
Advanced Graph Theory Research (9%),
Limits and Structures in Graph Theory (9%),
Advanced Combinatorial Mathematics (8%)
OpenAlex ID:
keywords/integer-grid
The Domination Number of Grids
2011
·
Daniel Gonçalves
, Alexandre Pinlou
, et al.
·
SIAM Journal on Discrete Mathematics
·
152
PDF
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
2003
·
Stefan Felsner
, Giuseppe Liotta
, et al.
·
Journal of Graph Algorithms and Applications
·
121
Efficient data structures for range searching on a grid
1988
·
Mark H Overmars
·
Journal of Algorithms
·
104
On the area of binary tree layouts
1980
·
R.P. Brent
, H.T. Kung
·
Information Processing Letters
·
93
Best approximate circles on integer grids
1983
·
M. D. McIlroy
·
ACM Transactions on Graphics
·
83
PDF
On Dominance Reporting in 3D
2008
·
Peyman Afshani
·
Lecture notes in computer science
·
74
Planar Embedding of Planar Graphs
1983
·
Danny Dolev
, Frank Thomson Leighton
, et al.
·
DSpace@MIT (Massachusetts Institute of Technology)
·
70
PDF
Optimizing area and aspect ratio in straight-line orthogonal tree drawings
2002
·
Timothy M. Chan
, Michael T. Goodrich
, et al.
·
Computational Geometry
·
51
PDF
Multiquadric interpolation improved
1992
·
Martin D. Buhmann
, Charles A. Micchelli
·
Computers & Mathematics with Applications
·
51
On Quasi-interpolation with Radial Basis Functions
1993
·
M.D. Buhmann
·
Journal of Approximation Theory
·
47
The rectangle of influence drawability problem
1998
·
G. Liotta
, A. Lubiw
, et al.
·
Computational Geometry
·
46
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
2002
·
Stefan Felsner
, Giuseppe Liotta
, et al.
·
Lecture notes in computer science
·
41
PDF
Efficient regular data structures and algorithms for location and proximity problems
2003
·
A. Amir
, A. Efrat
, et al.
·
Annual Symposium on Foundations of Computer Science
·
36
Area-efficient algorithms for straight-line tree drawings
2000
·
Chan-Su Shin
, Sung Kwon Kim
, et al.
·
Computational Geometry
·
35
PDF
Thirty‐five‐point rectilinear steiner minimal trees in a day
1995
·
Jeffrey S. Salowe
, David M. Warme
·
Networks
·
33
A data structure for multi-dimensional range reporting
2007
·
Yakov Nekrich
·
Annual Symposium on Computational Geometry (SoCG)
·
30
Distance graph on Zn with ℓ1 norm
2004
·
Zoltán Füredi
, Jeong-Hyun Kang
·
Theoretical Computer Science
·
30
PDF
Integer‐Grid Sketch Simplification and Vectorization
2020
·
Tibor Stanko
, Mikhail Bessmeltsev
, et al.
·
Computer Graphics Forum
·
28
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
2005
·
Cesim Erten
, Stephen G. Kobourov
·
Theory of Computing Systems
·
28
PDF
Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs
2001
·
Michael Buro
·
Lecture notes in computer science
·
27
Box-Rectangular Drawings of Plane Graphs
2000
·
Md.Saidur Rahman
, Shin-ichi Nakano
, et al.
·
Journal of Algorithms
·
27
Stable snap rounding
2012
·
John Hershberger
·
Computational Geometry
·
25
PDF
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems
2001
·
A. Amir
, A. Efrat
, et al.
·
Algorithmica
·
24
Optimizing area and aspect ratio in straight-line orthogonal tree drawings
1997
·
Timothy Chan
, S. Rao Kosaraju
, et al.
·
Lecture notes in computer science
·
24
PDF
Drawing series-parallel graphs on a box.
2002
·
Emilio Di Giacomo
, Giuseppe Liotta
, et al.
·
Canadian Conference on Computational Geometry
·
23
Show more works
View as search
Works count:
178
Citation count:
1,812
Year
Topic
Type