11 citations · 60 across the 20 of their papers we have counts for
Showing 2016 · cs.CGShow all
2 papers · 2 filters
cs.CG2016
How to Cut Corners and Get Bounded Convex Curvature
Mikkel Abrahamsen, Mikkel Thorup
We describe an algorithm for solving an important geometric problem arising in computer-aided manufacturing. When cutting away a region from a solid piece of material -- such as st…
cs.CG2016★ 4 cited
Common tangents of two disjoint polygons in linear time and constant workspace
Mikkel Abrahamsen, Bartosz Walczak
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cy…