20 citations · 23 across the 21 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CG2017
Dynamic smooth compressed quadtrees (Fullversion)
Ivor Hoog v. d., Elena Khramtcova, Maarten Löffler
We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with worst-case constant time updates in constant dimensions. We distinguish two versions of the problem. First,…
cs.CG2017★ 20 cited
Maximum-Area Triangle in a Convex Polygon, Revisited
Vahideh Keikha, Maarten Löffler, Ali Mohades +2
We revisit the following problem: Given a convex polygon , find the largest-area inscribed triangle. We show by example that the linear-time algorithm presented in 1979 by Dobki…