| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6872652 | Discrete Applied Mathematics | 2012 | 9 Pages |
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
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
T. Schiffer, F. Aurenhammer, M. Demuth,