Faster counting empty convex polygons in a planar point set
type: Item
instance of: scholarly article
title: Faster counting empty convex polygons in a planar point set
author: Sang Won Bae
published in: Information Processing Letters
publication date: 2021-12-14T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7444829
zbMATH Keywords: Erdös-Szekeres problem
zbMATH Keywords: counting problem
zbMATH Keywords: polygon
zbMATH Keywords: discrete geometry
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
full work available at URL: j.ipl.2021.106221
OpenAlex ID: W3212295152
cites work: Holes and Islands in Random Point Sets
cites work: Empty Simplices in Euclidean Space
cites work: Planar point sets with a small number of empty convex polygons
cites work: Searching for empty convex polygons
cites work: Planar sets with few empty convex polygons
cites work: Q3207683
cites work: Q5759552
cites work: Q3286826
cites work: Empty convex hexagons in planar point sets
cites work: Konvexe Fünfecke in ebenen Punktmengen
cites work: Sets with No Empty Convex 7-Gons
cites work: Counting convex polygons in planar point sets
cites work: The empty hexagon theorem
cites work: On empty convex polygons in a planar point set
cites work: Counting \(k\)-subsets and convex \(k\)-gons in the plane
cites work: Counting convex \(k\)-gons in planar point sets
cites work: On the Erdős-Szekeres convex polygon problem
cites work: Computer solution to the 17-point Erdős-Szekeres problem
cites work: Q5290279
cites work: Q4879100
cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
DOI: 10.1016/J.IPL.2021.106221
description: scientific article; zbMATH DE number 7444829