4 citations · 8 across the 6 of their papers we have counts for
6 papers
The Shadows of a Cycle Cannot All Be Paths
Prosenjit Bose, Jean-Lou De Carufel, Michael G. Dobbins +2
A "shadow" of a subset of Euclidean space is an orthogonal projection of into one of the coordinate hyperplanes. In this paper we show that it is not possible for all three…
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…
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel +2
Consider a weighted graph G where vertices are points in the plane and edges are line segments. The weight of each edge is the Euclidean distance between its two endpoints. A routi…
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…
Optimal Data Structures for Farthest-Point Queries in Cactus Networks
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm +2
Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of…
Continuous Yao Graphs
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel +5
In this paper, we introduce a variation of the well-studied Yao graphs. Given a set of points and an angle , we define the continuous Yao grap…