70 search results - page 1 / 14 » On Convex Quadrangulations of Point Sets on the Plane |
CJCDGCGT
2005
Springer
13 years 10 months ago
2005
Springer
CORR
2002
Springer
13 years 4 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...
WADS
1995
Springer
13 years 8 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...
GD
2004
Springer
13 years 10 months ago
2004
Springer
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length n + c n log n . We disprove a conjecture of Erd˝o...
SIAMDM
2011
12 years 11 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...