scientific article; zbMATH DE number 140473

MaRDI QIDQ4028890zbMATH OpenFDO

Authors Jeffrey S. Salowe

Publication date 28 March 1993

zbMATH Keywords

decision problempseudo-polynomial-time algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Distributed algorithms (68W15)

Recommendations

• Finding Extremal Polygons
• scientific article; zbMATH DE number 522850
• Finding minimum area \(k\)-gons
• On \(k\)-convex point sets
• Counting convex \(k\)-gons in planar point sets

Cited in

(2)

• The complexity of the \(K\)th largest subset problem and related problems
• L-infinity interdistance selection by parametric search

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028890)