Computing convex quadrangulations

MaRDI QIDQ2948423zbMATH OpenFDO

Authors Franz Aurenhammer, M. Demuth, T. Schiffer

Publication date 30 September 2015

zbMATH Keywords

Delaunay tessellationmaximum independent setmesh generationconvex quadrangulation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

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

Cited in

(5)

• Computing convex quadrangulations
• Experimental results on quadrangulations of sets of fixed points
• 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

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 Q2948423)