99 search results - page 1 / 20 » On empty convex polygons in a planar point set |
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
GC
2007
Springer
13 years 4 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
CCCG
2007
13 years 6 months ago
2007
We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...
SIAMDM
2010
13 years 3 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...