Faster counting empty convex polygons in a planar point set

DOI10.1016/j.ipl.2021.106221OpenAlexW3212295152MaRDI QIDQ2059898

Sang Won Bae

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106221

zbMATH Keywords

polygondiscrete geometrycomputational geometrycounting problemErdös-Szekeres problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching for empty convex polygons
• Counting \(k\)-subsets and convex \(k\)-gons in the plane
• Counting convex \(k\)-gons in planar point sets
• Konvexe Fünfecke in ebenen Punktmengen
• Counting convex polygons in planar point sets
• On empty convex polygons in a planar point set
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• Planar sets with few empty convex polygons
• Computer solution to the 17-point Erdős-Szekeres problem
• Sets with No Empty Convex 7-Gons
• Empty Simplices in Euclidean Space
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
• On the Erdős-Szekeres convex polygon problem
• Planar point sets with a small number of empty convex polygons
• Holes and Islands in Random Point Sets

This page was built for publication: Faster counting empty convex polygons in a planar point set