We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double...
Oswin Aichholzer, David Orden, Francisco Santos, B...
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
Oswin Aichholzer, Michael Hoffmann, Bettina Speckm...
In this paper we introduce a robust matching technique that allows to operate a very accurate selection of corresponding feature points from multiple views. Robustness is achieved...
Emanuele Rodolà, Andrea Albarelli, Andrea Torsell...
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjo...
Thomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber