Chains, Koch chains, and point sets with many triangulations

DOI10.4230/LIPICS.SOCG.2022.59MaRDI QIDQ6539563zbMATH OpenFDO

Authors Daniel Rutschmann, Manuel Wettstein

Publication date 14 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2022.59

zbMATH Keywords

chainKoch chainlower boundmaximum number of triangulationsplanar point settriangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Counting triangulations of planar point sets
• A lower bound on the number of triangulations of planar point sets
• An improved lower bound on the minimum number of triangulations
• Bounds on the maximum multiplicity of some common geometric graphs

This page was built for publication: Chains, Koch chains, and point sets with many triangulations

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