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.
authors.affiliation: Institute of Computer Graphics and Knowledge Visualization, University of Technology, Graz, Austria.
authors.forename: T
authors.initials: T
authors.lastname: Schiffer
authors.forename: F
authors.initials: F
authors.lastname: Aurenhammer
authors.forename: M
authors.initials: M
authors.lastname: Demuth