A lower bound on the number of triangulations of planar point sets

DOI10.1016/J.COMGEO.2004.02.003zbMATH Open1061.65013OpenAlexW2160689382MaRDI QIDQ1882855FDOQ1882855

Authors: Marc Noy, Oswin Aichholzer, Ferran Hurtado 

Publication date: 1 October 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.02.003

Recommendations

• A better upper bound on the number of triangulations of a planar point set
• A lower bound for the number of polygonizations of \(N\) points in the plane
• An improved lower bound on the minimum number of triangulations
• The Number of Triangulations on Planar Point Sets
• Counting triangulations of planar point sets

zbMATH Keywords

triangulationscounting

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Improved bounds for planar \(k\)-sets and related problems
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• A better upper bound on the number of triangulations of a planar point set
• Reverse search for enumeration
• Note on the Erdős-Szekeres theorem
• Title not available (Why is that?)
• Convexity minimizes pseudo-triangulations
• Enumerating order types for small point sets with applications
• Crossing families
• Generation of oriented matroids --- a graph theoretical approach
• SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS

Cited In (34)

• A lower bound for the number of polygonizations of \(N\) points in the plane
• Title not available (Why is that?)
• Abstract order type extension and new results on the rectilinear crossing number
• On the numerical implementation of variational arbitrary Lagrangian–Eulerian (VALE) formulations
• Constrained independence system and triangulations of planar point sets
• On degrees in random triangulations of point sets
• On degrees in random triangulations of point sets
• Embedding the double circle in a square grid of minimum size
• Configurations of non-crossing rays and related problems
• Improved upper bounds on the reflexivity of point sets
• Connectivity of triangulation flip graphs in the plane
• The Number of Triangulations on Planar Point Sets
• A new lower bound on the maximum number of plane graphs using production matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• On crossing-families in planar point sets
• A simple aggregative algorithm for counting triangulations of planar point sets and related problems
• An improved lower bound on the minimum number of triangulations
• A better upper bound on the number of triangulations of a planar point set
• Counting triangulations and other crossing-free structures via onion layers
• Counting polygon triangulations is hard
• Title not available (Why is that?)
• On the number of plane geometric graphs
• On the number of pseudo-triangulations of certain point sets
• Minimum number of partial triangulations
• Title not available (Why is that?)
• Convexity minimizes pseudo-triangulations
• Counting triangulations of balanced subdivisions of convex polygons
• An improved FPT algorithm for the flip distance problem
• The Mathematics of Ferran Hurtado: A Brief Survey
• Chains, Koch chains, and point sets with many triangulations
• Counting triangulations of some classes of subdivided convex polygons
• Computing the flip distance between triangulations
• Counting triangulations and other crossing-free structures approximately

This page was built for publication: A lower bound on the number of triangulations of planar point sets

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