1370 search results - page 107 / 274 » On grids in topological graphs |
158
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
187
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
163
click to vote
VISUALIZATION
2005
IEEE
15 years 12 months ago
2005
IEEE
We describe a new dynamic level-of-detail (LOD) technique that allows real-time rendering of large tetrahedral meshes. Unlike approaches that require hierarchies of tetrahedra, ou...
181
click to vote
JVM
2004
15 years 7 months ago
2004
Virtual machines can greatly simplify wide-area discomputing by lowering the level of abstraction to the benefit of both resource providers and users. Networking, however, can be ...
237
click to vote
HICSS
2012
IEEE
14 years 2 months ago
2012
IEEE
The concept of interoperability of data and model as presented in this paper is viewed as being very useful for implementing variety of future applications related to power system...