450 search results - page 28 / 90 » Quadrangulations of Planar Sets |
119
click to vote
CGF
2010
14 years 12 months ago
2010
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
EJC
2007
14 years 11 months ago
2007
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a cho...
IVC
2007
14 years 11 months ago
2007
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
105
click to vote
JGAA
2002
14 years 11 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...