450 search results - page 1 / 90 » Quadrangulations of Planar Sets |
WADS
1995
Springer
13 years 9 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
CJCDGCGT
2005
Springer
13 years 11 months ago
2005
Springer
COMBINATORICS
2004
13 years 5 months ago
2004
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...