Computing convex quadrangulations
Thomas Schiffer, Franz Aurenhammer, Markus Demuth · Discrete Applied Mathematics · 2011
We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set.