Counting convex \(k\)-gons in planar point sets

DOI10.1016/0020-0190(92)90178-XzbMath0751.68077OpenAlexW2801194566MaRDI QIDQ1190511

Günter Rote, Gerhard J. Woeginger

Publication date: 26 September 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90178-x

zbMATH Keywords

convexity

Mathematics Subject Classification ID

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

Related Items (3)

Counting convex polygons in planar point sets ⋮ Empty squares in arbitrary orientation among points ⋮ Faster counting empty convex polygons in a planar point set

Cites Work

• On a triangle counting problem
• The power of geometric duality revisited
• Counting \(k\)-subsets and convex \(k\)-gons in the plane
• Constructing Arrangements of Lines and Hyperplanes with Applications

This page was built for publication: Counting convex \(k\)-gons in planar point sets