scientific article

zbMath0474.52004MaRDI QIDQ3928584

No author found.

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmlargest convex subset of set of n points in plane

Mathematics Subject Classification ID

Dynamic programming (90C39) Convex sets in (2) dimensions (including convex curves) (52A10) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items

Counting convex polygons in planar point sets ⋮ Topologically sweeping an arrangement ⋮ Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set ⋮ Bottleneck convex subsets: finding \(k\) large convex sets in a point set ⋮ Maximum Rectilinear Convex Subsets ⋮ The Parameterized Complexity of Finding Point Sets with Hereditary Properties ⋮ Sequential and parallel algorithms for finding a maximum convex polygon ⋮ Covering paths for planar point sets ⋮ Convex polygons in Cartesian products ⋮ The Erdos-Szekeres problem on points in convex position – a survey