Lattice graph

Known as: Triangular grid graph, Grid graph, Mesh graph 
A lattice graph, mesh graph, or grid graph, is a graph whose drawing, embedded in some Euclidean space Rn, forms a regular tiling. This implies that… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Design of filters for graph signal processing benefits from knowledge of the spectral decomposition of matrices that encode… (More)
  • figure 1
Is this relevant?
2016
2016
In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Recently, it has been shown that a quantize-map-and-forward scheme approximately achieves (within a constant number of bits) the… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter… (More)
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Gestalt phenomena have long resisted quantification. In the spirit of Gestalt field theory, we propose a theory that predicts the… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2007
2007
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method… (More)
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We describe in this paper two on-line algorithms for covering planar areas by a square-shaped tool attached to a mobile robot… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
This paper describes a generalized sequential diagnosis algorithm whose analysis leads to strong diagnosability results for a… (More)
Is this relevant?