Sciweavers

17 search results - page 1 / 4
» Empty Monochromatic Triangles
Sort
View
CCCG
2008
14 years 9 days ago
Empty Monochromatic Triangles
We consider a variation of a problem stated by Erd
Oswin Aichholzer, Ruy Fabila Monroy, David Flores-...
ENDM
2011
227views Hardware» more  ENDM 2011»
12 years 10 months ago
Bichromatic Triangle Games
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...
Gordana Manic, Daniel M. Martin, Milos Stojakovic
SIAMDM
2010
123views more  SIAMDM 2010»
13 years 9 months ago
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
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...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...
CCCG
2007
14 years 9 days ago
On the Number of Empty Pseudo-Triangles in Point Sets
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...
Marc J. van Kreveld, Bettina Speckmann
CCCG
2009
13 years 12 months ago
Optimal Empty Pseudo-Triangles in a Point Set
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 ...
Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher