19 citations · 101 across the 17 of their papers we have counts for
7 papers · 1 filter
Linear transformation distance for bichromatic matchings
Oswin Aichholzer, Luis Barba, Thomas Hackl +2
Let be a set of points in general position, where is a set of blue points and a set of red points. A \emph{-matching} is a plane geometric perf…
Monotone Simultaneous Embedding of Directed Paths
Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp +3
We study monotone simultaneous embeddings of upward planar digraphs, which are simultaneous embeddings where the drawing of each digraph is upward planar, and the directions of the…
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
Oswin Aichholzer, Thomas Hackl, David Orden +3
In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combin…
Geodesic-Preserving Polygon Simplification
Oswin Aichholzer, Thomas Hackl, Matias Korman +2
Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the inpu…
Empty triangles in good drawings of the complete graph
Oswin Aichholzer, Thomas Hackl, Alexander Pilz +3
A 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…
Geometric achromatic and pseudoachromatic indices
O. Aichholzer, G. Araujo-Pardo, N. García-Colín +4
The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. If…