29 citations · 89 across the 22 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CG2015★ 4 cited
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer +2
Let be a set of labeled points in the plane. The radial system of describes, for each , the order in which a ray that rotates around encounters the points i…
cs.CG2015
Ham-Sandwich Cuts for Abstract Order Types
Stefan Felsner, Alexander Pilz
The linear-time ham-sandwich cut algorithm of Lo, Matoušek, and Steiger for bi-chromatic finite point sets in the plane works by appropriately selecting crossings of the lines in t…
cs.CG2015★ 3 cited
The Dual Diameter of Triangulations
Matias Korman, Stefan Langerman, Wolfgang Mulzer +3
Let $\Poly$ be a simple polygon with vertices. The \emph{dual graph} $\triang^*$ of a triangulation~$\triang$ of~$\Poly$ is the graph whose vertices correspond to the bounded f…