Finding the Maximum Subset with Bounded Convex Curvature

DOI10.4230/LIPICS.SOCG.2016.4MaRDI QIDQ3132835zbMATH OpenOpenAlexFDO

Authors Mikkel Abrahamsen, Mikkel Thorup

Publication date 30 January 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.SoCG.2016.4

zbMATH Keywords

bounded curvaturepocket machiningplanar computational geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07)

Recommendations

• Maximum rectilinear convex subsets
• Maximum rectilinear convex subsets
• scientific article; zbMATH DE number 3891108
• scientific article; zbMATH DE number 999528
• Extremal problems on the convex hull of a space curve
• Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
• Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
• Bottleneck convex subsets: finding k large convex sets in a point set
• scientific article; zbMATH DE number 522850

Cited in

(2)

• Disks in curves of bounded convex curvature
• How to cut corners and get bounded convex curvature

This page was built for publication: Finding the Maximum Subset with Bounded Convex Curvature

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