Finding the Maximum Subset with Bounded Convex Curvature

DOI10.4230/LIPIcs.SoCG.2016.4zbMath1387.68224OpenAlexW2962685005MaRDI QIDQ3132835

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 science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

How to cut corners and get bounded convex curvature ⋮ Disks in Curves of Bounded Convex Curvature

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