Computing convex quadrangulations |
| |
| Authors: | T. Schiffer F. Aurenhammer M. Demuth |
| |
| Affiliation: | 1. Institute of Computer Graphics and Knowledge Visualization, University of Technology, Graz, Austria;2. Institute for Theoretical Computer Science, University of Technology, Graz, Austria |
| |
| 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: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
