Counting \(k\)-subsets and convex \(k\)-gons in the plane

DOI10.1016/0020-0190(91)90237-CzbMath0737.68084OpenAlexW2015612912MaRDI QIDQ1178214

Zhengyan Wang, Günter Rote, Binhai Zhu, Gerhard J. Woeginger

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90237-c

zbMATH Keywords

convexity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Counting convex polygons in planar point sets ⋮ Empty squares in arbitrary orientation among points ⋮ Counting the number of crossings in geometric graphs ⋮ Counting convex \(k\)-gons in planar point sets ⋮ Faster counting empty convex polygons in a planar point set ⋮ Convex partial transversals of planar regions

Cites Work

• On a triangle counting problem
• Finding minimum area \(k\)-gons
• Constructing Arrangements of Lines and Hyperplanes with Applications