Computing convex quadrangulations

https://doi.org/10.1016/j.dam.2011.11.002Get rights and content
Under a Creative Commons license
open access

Abstract

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.

Keywords

Irregular quadrilateral mesh
Convex quadrangles
Shape quality
Delaunay tetrahedra
Maximum independent set

Cited by (0)

Supported by the Austrian FWF Projects DK ‘Confluence of Vision and Graphics’ and NRN ‘Industrial Geometry’ S9205-N12.