Modem Illumination of Monotone Polygons (2009)
Oswin Aichholzer, Ruy Fabila-monroy, David Flores-peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia, ...
We 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...
Maximizing Maximal Angles for Plane Straight-Line Graphs ⋆ (2009)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, ...
Abstract. Let G =(S, E) be a plane straight-line graph on a finite point set S ⊂ R 2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges of G that...
Ziel der Arbeit war die Beurteilung der myokardialen Kontrastmittel-(KM)-Anreicherung nach akutem Myokardinfarkt (AMI). Siebzehn Patienten mit AMI und erfolgreicher Reperfusion wurden in der...
Flip Graphs of Degree-Bounded (Pseudo-)Triangulations (2009)
Aichholzer, Oswin, Hackl, Thomas, Orden, David, Ramos, Pedro, Rote, Günter, Schulz, André, ...
We study flip graphs of (pseudo-)triangulations whose maximum vertex degree is bounded by a constant k. In particular, we consider (pseudo-)triangulations of sets of n points in convex position in...
Lower and upper bounds on the number of empty cylinders and ellipsoids (2009)
Aichholzer, Oswin, Aurenhammer, Franz, Devillers, Olivier, Hackl, Thomas, Teillaud, Monique, Vogtenhuber, Birgit
Given a set S of n points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in S in several ways. Among various results we prove that the number of empty...
Lower and upper bounds on the number of empty cylinders and ellipsoids (2009)
Aichholzer, Oswin, Aurenhammer, Franz, Devillers, Olivier, Hackl, Thomas, Teillaud, Monique, Vogtenhuber, Birgit
Given a set S of n points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in S in several ways. Among various results we prove that the number of empty...
Es gibt eine Vielzahl von Beispielen, bei denen hydrophobe Wechselwirkungen in Bezug auf molekulare Erkennungsprozesse in biologischen Systemen eine wichtige Rolle spielen. Das STD-NMR-Verfahren hat...
On (Pointed) Minimum Weight Pseudo-Triangulations (2008)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
In this note we discuss some structural properties of minimum weight (pointed) pseudo-triangulations. 1
Maximizing Maximal Angles for Plane Straight Line Graphs (2008)
Oswin Aichholzer, Thomas Hackl, Francisco Santos
Let G =(S, E) be a plane straight line graph on a finite point set S ⊂ R 2 in general position. For a point p ∈ S let the maximum incident angle of p in G be the maximum angle between any two...
Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser
We investigate the number of plane geometric, i.e., straight-line, graphs, a set S of n points in the plane admits. We show that the number of plane graphs and connected plane graphs as well as the...
On (Pointed) Minimum Weight Pseudo-Triangulations (2008)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
In this note we discuss some structural properties of minimum weight (pointed) pseudo-triangulations. 1
Maximizing Maximal Angles for Plane Straight Line Graphs (2008)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Francisco Santos
Let G =(S, E) be a plane straight line graph on a finite point set S ⊂ R 2 in general position. For a point p ∈ S let the maximum incident angle of p in G be the maximum angle between any two...
Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem (2008)
Aicholzer, Oswin, Devillers, Olivier, Aurenhammer, Franz, Hackl, Thomas, Teillaud, Monique, Vogtenhuber, Birgit
Given a set $\cal S$ of $n$ points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in $\cal S$ in various ways. We prove that the set of empty or enclosing...
Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem (2008)
Aicholzer, Oswin, Devillers, Olivier, Aurenhammer, Franz, Hackl, Thomas, Teillaud, Monique, Vogtenhuber, Birgit
Given a set $\cal S$ of $n$ points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in $\cal S$ in various ways. We prove that the set of empty or enclosing...
Matching edges and faces in polygonal partitions (2008)
Aichholzer, Oswin, Aurenhammer, Franz, Gonzalez-Nava, Paola, Hackl, Thomas, Huerner, Clemens, Hurtado, Ferran, ...
Maximizing Maximal Angles for Plane Straight-Line Graphs (2007)
Aichholzer, Oswin, Hackl, Thomas, Hoffmann, Michael, Huemer, Clemens, Por, Attila, Santos, Francisco, ...
Let $G=(S, E)$ be a plane straight-line graph on a finite point set $S\subset\R^2$ in general position. The \emph{incident angles} of a point $p \in S$ in $G$ are the angles between any two edges of...
On the number of plane graphs (2006)
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Birgit Vogtenhuber
We investigate the number of plane geometric, i.e., straight-line, graphs, a set S of n points in the plane admits. We show that the number of plane graphs is minimized when S is in convex position,...
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, B. Vogtenhuber, ...
We investigate the number of plane geometric, i.e., straight-line, graphs, a set S of n points in the plane admits. We show that the number of plane geometric graphs and connected plane geometric...
O. Aichholzer, F. Aurenhammer, T. Hackl, C. Huemer, Oswin Aichholzer, Franz Aurenhammer, ...
We study the following Ramsey-type problem. Let S = B ∪ R be a two-colored set of n points in the plane. We show how to construct, in O(n log n) time, a crossing-free spanning tree T(B) for B, and...