Convex Polygons in Geometric Triangulations

DOI10.1017/S0963548317000141zbMath1372.68263OpenAlexW2949607879MaRDI QIDQ5366966

Adrian Dumitrescu, Csaba D. Tóth

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548317000141

zbMATH Keywords

convex polygonsplanar straight-line graph

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Monotone paths in geometric triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting carambolas
• Rainbow of computer science. Dedicated to Hermann Maurer on the occasion of his 70th birthday
• Peeling meshed potatoes
• Counting triangulations of planar point sets
• Monotone paths in geometric triangulations
• A polynomial solution for the Potato-peeling problem
• On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato
• Finding minimum area \(k\)-gons
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
• Counting triangulations and other crossing-free structures approximately
• On the number of plane geometric graphs
• Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
• Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• On the Number of Cycles in Planar Graphs
• Crossing-Free Subgraphs
• The Erdos-Szekeres problem on points in convex position – a survey
• How Many Potatoes Are in a Mesh?
• A simple aggregative algorithm for counting triangulations of planar point sets and related problems
• Number of Crossing-Free Geometric Graphs vs. Triangulations
• Counting Plane Graphs: Cross-Graph Charging Schemes

This page was built for publication: Convex Polygons in Geometric Triangulations