2 papers
cs.CG2016
Some Counterexamples for Compatible Triangulations
Cody Barnson, Dawn Chandler, Qiao Chen +13
We consider the conjecture by Aichholzer, Aurenhammer, Hurtado, and Krasser that any two points sets with the same cardinality and the same size convex hull can be triangulated in…
cs.CG2015
Time-Space Trade-off Algorithms for Triangulating a Simple Polygon
Boris Aronov, Matias Korman, Simon Pratt +2
An -workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses additional words of space. We…