An Upper Bound for the Number of Planar Lattice Triangulations

2002/12/10 by Emile E. Anclin, Anclin, Emile E. · 1 citation
Computer Science · Mathematics · #05A16 #05C30 #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #FOS: Mathematics #Metric Geometry (math.MG) #Topological and Geometric Data Analysis #math.CO #math.MG #msc:05A16 #msc:05C30

paper · pdf · doi:10.48550/arxiv.math/0212140

4 pages, 3 figures

arxiv created 2002/12/10 · openalex publication_date 2002/12/10 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We prove an exponential upper bound for the number f(m,n) of all maximal triangulations of the m× n grid: f(m,n) lt; 2^3mn. In particular, this improves a result of S. Yu. Orevkov (1999).

Cited by

• Counting Triangulations of Fixed Cardinal Degrees

Related

• Counting Lattice Triangulations
• Counting Triangulations of Planar Point Sets
• Triangulations Admit Dominating Sets of Size 2n/7
• Counting cycles in planar triangulations
• Asymptotics of the number of lattice triangulations of rectangles of width 4 and 5