CORR
2002
Springer
13 years 11 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...
COMPGEOM
2009
ACM
14 years 6 months ago
2009
ACM
In this paper, we present an algorithm that utilizes a quadtree data structure to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly cr...