20 citations · 66 across the 52 of their papers we have counts for
Showing 2026 · cs.CGShow all
2 papers · 2 filters
cs.CG2026
On the Spanning Ratio of the Greedy Triangulation for Convex Point Sets
Prosenjit Bose, Jean Lou de Carufel, Anil Maheshwari +3
The greedy triangulation of a finite planar point set is obtained by considering all segments in nondecreasing order of length and inserting each segment that does not cross an ear…
cs.CG2026
Linear-Time -Approximation Algorithms for Two-Line-Center Problems
Chaeyoon Chung, Anil Maheshwari, Michiel Smid
Given a set of points in the plane, we study the two-line-center problem: finding two lines that minimize the maximum distance from each point in to its closest line. W…