Squaregraph

Known as: Quadrangulation 
In graph theory, a branch of mathematics, a squaregraph is a type of undirected graph that can be drawn in the plane in such a way that every bounded… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Thanks to recent improvements, computational methods can now be used to convert triangular meshes into quadrilateral meshes so… (More)
  • figure 1
Is this relevant?
2012
2012
We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper proposes a new method for remeshing a surface into anisotropically sized quads. The basic idea is to construct a… (More)
Is this relevant?
2010
2010
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
 
Is this relevant?
2004
2004
Lofting is a traditional technique for creating a curved shape by first specifying a network of curves that approximates the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper, a surprising connection is described between a specific brand of random lattices, namely planar quadrangulations… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
It has been shown that every quadrangulation on any nonspherical orientable closed surface with a suf®ciently large… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1999
1999
Petersen’s theorem is a classic result in matching theory from 1891, stating that every bregular bridgeless graph has a perfect… (More)
Is this relevant?