Computing convex quadrangulations

DOI10.1016/j.dam.2011.11.002zbMath1236.68282OpenAlexW2104775550WikidataQ41049885 ScholiaQ41049885MaRDI QIDQ412380

M. Demuth, T. Schiffer, Franz Aurenhammer

Publication date: 4 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.002

zbMATH Keywords

maximum independent setconvex quadranglesDelaunay tetrahedrairregular quadrilateral meshshape quality

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Convex Quadrangulations of Bichromatic Point Sets

Uses Software

• Qhull
• Q-Morph

Cites Work

• Greed is good: Approximating independent sets in sparse and bounded-degree graphs
• Stabbing Delaunay tetrahedralizations
• Quadrilateral mesh generation in polygonal regions
• Converting triangulations to quadrangulations
• Experimental results on quadrangulations of sets of fixed points
• Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
• Small strictly convex quadrilateral meshes of point sets
• Incremental topological flipping works for regular triangulations
• Scattered Data Interpolation Using C2 Supersplines of Degree Six
• The quickhull algorithm for convex hulls
• A new indirect anisotropic quadrilateral mesh generation scheme with enhanced local mesh smoothing procedures
• CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE
• QUADRILATERAL MESHING BY CIRCLE PACKING
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing convex quadrangulations