19 citations · 74 across the 43 of their papers we have counts for
6 papers · 1 filter
Perfect k-colored matchings and (k+2)-gonal tilings
Oswin Aichholzer, Lukas Andritsch, Karin Baur +1
We derive a simple bijection between geometric plane perfect matchings on points in convex position and triangulations on points in convex position. We then extend this…
Geodesic Order Types
Oswin Aichholzer, Matias Korman, Alexander Pilz +1
The geodesic between two points and in the interior of a simple polygon~ is the shortest polygonal path inside that connects to . It is thus the natural gener…
Lombardi Drawings of Knots and Links
Philipp Kindermann, Stephen Kobourov, Maarten Löffler +3
Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into , such that no more than two points project to the same point in . These dia…
Routing in Polygonal Domains
Bahareh Banyassady, Man-Kwun Chiu, Matias Korman +7
We consider the problem of routing a data packet through the visibility graph of a polygonal domain with vertices and holes. We may preprocess to obtain a label and…
Packing Short Plane Spanning Graphs in Complete Geometric Graphs
Oswin Aichholzer, Thomas Hackl, Matias Korman +5
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want t…
A superlinear lower bound on the number of 5-holes
Oswin Aichholzer, Martin Balko, Thomas Hackl +5
Let be a finite set of points in the plane in general position, that is, no three points of are on a common line. We say that a set of five points from is a -hol…