Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,218,479 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Algorithm
Face (geometry)
Forbidden graph characterization
Graph drawing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Rhombus Tilings of an Even-Sided Polygon and Quadrangulations on the Projective Plane
Hiroaki Hamanaka
,
Atsuhiro Nakamoto
,
Yusuke Suzuki
Graphs Comb.
2020
Corpus ID: 214498576
A quadrangulation on a closed surface is k -minimal if its shortest noncontractible cycle is of length k and if any face…
Expand
2015
2015
Frame field generation through metric customization
Tengfei Jiang
,
Xianzhong Fang
,
Jin Huang
,
H. Bao
,
Y. Tong
,
M. Desbrun
ACM Transactions on Graphics
2015
Corpus ID: 12883349
This paper presents a new technique for frame field generation. As generic frame fields (with arbitrary anisotropy, orientation…
Expand
Highly Cited
2014
Highly Cited
2014
Frame fields
Daniele Panozzo
,
E. Puppo
,
M. Tarini
,
O. Sorkine-Hornung
ACM Transactions on Graphics
2014
Corpus ID: 587955
We introduce frame fields, which are a non-orthogonal and non-unit-length generalization of cross fields. Frame fields represent…
Expand
Highly Cited
2012
Highly Cited
2012
Recurrence of planar graph limits
O. Gurel-Gurevich
,
Asaf Nachmias
2012
Corpus ID: 13782130
We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost…
Expand
2011
2011
Real-time Rendering of Stack-based Terrains
Falko Löffler
,
A. Müller
,
H. Schumann
International Symposium on Vision, Modeling, and…
2011
Corpus ID: 18899451
Usually, terrain rendering relies on a 2D regular grid of height values, the so called height field. Height fields describe 2.5D…
Expand
2010
2010
Scaling limits for the uniform infinite quadrangulation
J. Gall
,
Laurent M'enard
2010
Corpus ID: 55722530
The uniform infinite planar quadrangulation is an infinite random graph embedded in the plane, which is the local limit of…
Expand
Highly Cited
2010
Highly Cited
2010
Anisotropic quadrangulation
Denis Kovacs
,
A. Myles
,
D. Zorin
Symposium on Solid and Physical Modeling
2010
Corpus ID: 14135655
Quadrangulation methods aim to approximate surfaces by semi-regular meshes with as few extraordinary vertices as possible. A…
Expand
Highly Cited
2004
Highly Cited
2004
Lofting curve networks using subdivision surfaces
S. Schaefer
,
J. Warren
,
D. Zorin
Eurographics Symposium on Geometry Processing
2004
Corpus ID: 10353842
Lofting is a traditional technique for creating a curved shape by first specifying a network of curves that approximates the…
Expand
2004
2004
Planar triangulations which quadrangulate other surfaces
Atsuhiro Nakamoto
,
Seiya Negami
,
K. Ota
,
J. Širáň
European journal of combinatorics (Print)
2004
Corpus ID: 9385717
Highly Cited
2001
Highly Cited
2001
Chromatic numbers of quadrangulations on closed surfaces
D. Archdeacon
,
J. Hutchinson
,
Atsuhiro Nakamoto
,
Seiya Negami
,
K. Ota
Journal of Graph Theory
2001
Corpus ID: 11448911
It has been shown that every quadrangulation on any nonspherical orientable closed surface with a sufficiently large…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required