8 citations · 36 across the 23 of their papers we have counts for
6 papers · 1 filter
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…
On interference among moving sensors and related problems
Jean-Lou De Carufel, Matya Katz, Matias Korman +3
We show that for any set of points moving along "simple" trajectories (i.e., each coordinate is described with a polynomial of bounded degree) in and any parameter $2 \…
Probing Convex Polygons with a Wedge
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet +1
Minimizing the number of probes is one of the main challenges in reconstructing geometric objects with probing devices. In this paper, we investigate the problem of using an -we…
Discrete Voronoi Games and -Nets, in Two and Three Dimensions
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari +1
The one-round discrete Voronoi game, with respect to a -point user set , consists of two players Player 1 () and Player 2 (). At first, $\mathca…
A linear-time algorithm for the geodesic center of a simple polygon
Hee-Kap Ahn, Luis Barba, Prosenjit Bose +3
Given two points in a simple polygon of vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within . The geod…