Browsing by Author "Aichholzer, Oswin"

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 ... 
Compatible matchings in geometric graphs
Aichholzer, Oswin; García Olaverri, Alfredo; Hurtado Díaz, Fernando Alfredo; Tejel Altarriba, F. Javier (Centre de Recerca Matemàtica, 2011)
Conference report
Open AccessTwo noncrossing geometric graphs on the same set of points are compatible if their union is also noncrossing. In this paper, we prove that every graph G that has an outerplanar embedding admits a noncrossing perfect ... 
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 ... 
Empty triangles in good drawings of the complete graph
Aichholzer, Oswin; Hackl, Thomas; Pilz, Alexander; Ramos Alonso, Pedro Antonio; Sacristán Adinolfi, Vera; Vogtenhuber, Birgit (2015)
Article
Restricted access  publisher's policyA good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges ... 
Geodesic order types
Aichholzer, Oswin; Korman Cozzetti, Matías; Pilz, Alexander; Vogtenhuber, Birgit (20140901)
Article
Restricted access  publisher's policyThe geodesic between two points a and b in the interior of a simple polygon P is the shortest polygonal path inside P that connects a to b. It is thus the natural generalization of straight line segments on unconstrained ... 
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 ... 
Order types and crosssections of line arrangements in R^3
Aichholzer, Oswin; FabilaMonroy, Ruy; Hurtado Díaz, Fernando Alfredo; Pérez Lantero, Pablo; Ruiz Vargas, Andrés; Urrutia Galicia, Jorge; Vogtenhuber, Birgit (2014)
Conference report
Restricted access  publisher's policyWe consider sets L = {l1,...., ln} of n labeled lines in general position in R3, and study the order types of point sets fp1; : : : ; png that stem from the intersections of the lines in L with (directed) planes II, not ... 
Twoconvex polygons
Aichholzer, Oswin; Aurenhammer, Franz; Hurtado Díaz, Fernando Alfredo; Ramos, Pedro A.; Urrutia, J. (Université Libre de Bruxelles, 2009)
Conference report
Open AccessWe introduce a notion of kconvexity and explore some properties of polygons that have this property. In particular, 2convex polygons can be recognized in O(n log n) time, and kconvex polygons can be triangulated in O(kn) time.