Browsing by Author "Hackl, Thomas"

4Holes in point sets
Aichholzer, Oswin; Fabila Monroy, Ruy; Gonzalez Aguilar, Hernan; Hackl, Thomas; Heredia, Marco A.; Huemer, Clemens; Urrutia Galicia, Jorge; Vogtenhuber, Birgit (20140801)
Article
Open AccessWe consider a variant of a question of Erdos on the number of empty kgons (kholes) in a set of n points in the plane, where we allow the kgons to be nonconvex. We show bounds and structural results on maximizing and ... 
Cellpaths in mono and bichromatic line arrangements in the plane
Aichholzer, Oswin; Cardinal, Jean; Hackl, Thomas; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matias; Pilz, Alexander; Silveira, Rodrigo Ignacio; Uehara, Ryuhei; Vogtenhuber, Birgit; Welzl, Emo (2014)
Conference report
Open AccessWe show that in every arrangement of n red and blue lines  in general position and not all of the same color  there is a path through a linear number of cells where red and blue lines are crossed alternatingly (and no ... 
EdgeRemoval and NonCrossing Configurations in Geometric Graphs
Aichholzer, Oswin; Cabello, Sergio; Fabila Monroy, Ruy; Flores Peñaloza, David; Hackl, Thomas; Huemer, Clemens; Hurtado Díaz, Fernando Alfredo; Wood, David (2010)
Article
Open AccessA geometric graph is a graph G = (V;E) drawn in the plane, such that V is a point set in general position and E is a set of straightline segments whose endpoints belong to V . We study the following extremal problem for ... 
Empty monochromatic simplices
Aichholzer, Oswin; Fabila Monroy, Ruy; Hackl, Thomas; Huemer, Clemens; Urrutia Galicia, Jorge (20140301)
Article
Open AccessLet S be a kcolored (finite) set of n points in , da parts per thousand yen3, in general position, that is, no (d+1) points of S lie in a common (d1)dimensional hyperplane. We count the number of empty monochromatic ... 
Large bichromatic point sets admit empty monochromatic 4gons
Aichholzer, Oswin; Hackl, Thomas; Huemer, Clemens; Hurtado Díaz, Fernando Alfredo; Vogtenhuber, Birgit (2009)
Conference report
Open AccessWe 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 position in the plane has a subset of k points that ... 
Lower bounds for the number of small convex kholes
Aichholzer, Oswin; Fabila Monroy, Ruy; Hackl, Thomas; Huemer, Clemens; Pilz, Alexander; Vogtenhuber, Birgit (20140701)
Article
Open AccessLet S be a set of n points in the plane in general position, that is, no three points of S are on a line. We consider an Erdostype question on the least number h(k)(n) of convex kholes in S, and give improved lower bounds ... 
Maximizing maximal angles for plane straightline graphs
Aichholzer, Oswin; Hackl, Thomas; Hoffmann, Michael; Huemer, Clemens; Pór, Attila; Santos, Francisco; Speckmann, Bettina; Vogtenhuber, Birgit (201301)
Article
Restricted access  publisher's policyLet G=(S,E) be a plane straightline graph on a finite point set S⊂R2 in general position. The incident angles of a point p∈S in G are the angles between any two edges of G that appear consecutively in the circular order ... 
Modem illumination of monotone polygons
Aichholzer, Oswin; Fabila Monroy, Ruy; Flores Peñaloza, David; Hackl, Thomas; Huemer, Clemens; Urrutia Galicia, Jorge; Vogtenhuber, Birgit (2009)
Conference report
Open AccessWe study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of walls. We call these ...