Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
From MaRDI portal
Publication:3132888
DOI10.4230/LIPIcs.SoCG.2016.52zbMath1387.68269arXiv1603.07340MaRDI QIDQ3132888
Publication date: 30 January 2018
Full work available at URL: https://arxiv.org/abs/1603.07340
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Crossing-Free Perfect Matchings in Wheel Point Sets, Unnamed Item, Connecting the dots (with minimum crossings), Convex Polygons in Geometric Triangulations, 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, Algorithmic enumeration of surrounding polygons, Parameterized analysis and crossing minimization problems, Counting polygon triangulations is hard