A simple aggregative algorithm for counting triangulations of planar point sets and related problems

DOI10.1145/2462356.2462392zbMath1305.68200OpenAlexW2004367845MaRDI QIDQ5174454

Raimund Seidel, Victor Alvarez

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2462356.2462392

zbMATH Keywords

triangulationscountinggeometric graphs

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set ⋮ Convex Polygons in Geometric Triangulations ⋮ Convex Polygons in Geometric Triangulations ⋮ Trapezoidal diagrams, upward triangulations, and prime Catalan numbers ⋮ An upper bound for the number of rectangulations of a planar point set ⋮ A QPTAS for the base of the number of crossing-free structures on a planar point set ⋮ Counting polygon triangulations is hard ⋮ Unnamed Item ⋮ Counting triangulations and other crossing-free structures approximately ⋮ Counting triangulations and other crossing-free structures via onion layers

This page was built for publication: A simple aggregative algorithm for counting triangulations of planar point sets and related problems