1 citations · 1 across the 7 of their papers we have counts for
3 papers · 1 filter
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…
Noncrossing Longest Paths and Cycles
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose +7
Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short…
Computing shortest paths amid non-overlapping weighted disks
Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban +1
In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of non-overlapping weighted disks in the plane. For a given parame…