40 citations · 98 across the 42 of their papers we have counts for
8 papers · 1 filter
Approximating the Integral Fréchet Distance
Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
A pseudo-polynomial time -approximation algorithm is presented for computing the integral and average Fréchet distance between two given polygonal curves a…
Plane Bichromatic Trees of Low Degree
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari +1
Let and be two disjoint sets of points in the plane such that , and no three points of are collinear. We show that the geometric complete bipart…
Approximation algorithms for the two-center problem of convex polygon
Sanjib Sadhu, Sasanka Roy, Soumen Nandi +2
Given a convex polygon with vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover . We propose an algo…
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari +1
We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the a…
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere
Prosenjit Bose, Paz Carmi, Mirela Damian +5
Let be a convex polyhedron in . The skeleton of is the graph whose vertices and edges are the vertices and edges of , respectively. We prove that, if these…
Strong Matching of Points with Geometric Shapes
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Let be a set of points in general position in the plane. Given a convex geometric shape , a geometric graph on is defined to have an edge between two points…