Computing convex quadrangulations

DOI10.1016/J.DAM.2011.11.002MaRDI QIDQ412380zbMATH OpenOpenAlexWikidataFDO

Authors T. Schiffer, M. Demuth, Franz Aurenhammer

Publication date 4 May 2012

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

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

Recommendations

• Computing convex quadrangulations
• Experimental results on quadrangulations of sets of fixed points
• Characterizing and efficiently computing quadrangulations of planar point sets
• scientific article; zbMATH DE number 2081026
• Quadrangulations of planar sets

Cites work

• scientific article; zbMATH DE number 432790 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1343168 (Why is no real title available?)
• A new indirect anisotropic quadrilateral mesh generation scheme with enhanced local mesh smoothing procedures
• CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE
• Computing convex quadrangulations
• Converting triangulations to quadrangulations
• Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
• Experimental results on quadrangulations of sets of fixed points
• Greed is good: Approximating independent sets in sparse and bounded-degree graphs
• Incremental topological flipping works for regular triangulations
• Introduction to algorithms
• QUADRILATERAL MESHING BY CIRCLE PACKING
• Quadrilateral mesh generation in polygonal regions
• Scattered Data Interpolation Using C2 Supersplines of Degree Six
• Small strictly convex quadrilateral meshes of point sets
• Stabbing Delaunay tetrahedralizations
• The quickhull algorithm for convex hulls

Cited in

(6)

• Computing convex quadrangulations
• Experimental results on quadrangulations of sets of fixed points
• Convex quadrangulations of bichromatic point sets
• A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
• scientific article; zbMATH DE number 4085023 (Why is no real title available?)
• Characterizing and efficiently computing quadrangulations of planar point sets

Describes a project that uses

Uses Software

• Q-Morph
• Qhull

This page was built for publication: Computing convex quadrangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412380)