17 search results - page 1 / 4 » Empty Monochromatic Triangles |
CCCG
2008
14 years 10 days ago
2008
We consider a variation of a problem stated by Erd
ENDM
2011
12 years 10 months ago
2011
We study a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B construct a triangulation on a given planar point set V . Starting from no...
SIAMDM
2010
13 years 9 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...
CCCG
2007
14 years 10 days 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...
CCCG
2009
13 years 12 months ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...