Computational geometry: an introduction
Computational geometry: an introduction
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Scattered Data Interpolation Using C2 Supersplines of Degree Six
SIAM Journal on Numerical Analysis
Minimum strictly convex quadrangulations of convex polygons
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Converting triangulations to quadrangulations
Computational Geometry: Theory and Applications
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Decomposing polygonal regions into convex quadrilaterals
SCG '85 Proceedings of the first annual symposium on Computational geometry
Introduction to Algorithms
Experimental results on quadrangulations of sets of fixed points
Computer Aided Geometric Design
Dense Point Sets Have Sparse Delaunay Triangulations or “... But Not Too Nasty”
Discrete & Computational Geometry
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.04 |
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.