Prosenjit Bose

activity

20242026

collaborators

Showing 2025Show all

4 papers · 1 filter

cs.CG2025

An Improved Bound for Plane Covering Paths

Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz +8

A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at…

cs.CG2025

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs

Prosenjit Bose, Jean-Lou De Carufel, John Stuart

A Delaunay graph built on a planar point set has an edge between two vertices when there exists a disk with the two vertices on its boundary and no vertices in its interior. When t…

cs.CG2025

On geodesic disks enclosing many points

Prosenjit Bose, Guillermo Esteban, David Orden +2

Let $Π (n)$ be the largest number such that for every set $S$ of $n$ points in a polygon~ $P$ , there always exist two points $x, y \in S$ , where every geodesic disk contain…

cs.CG2025

Closest Pair Queries in Vertical Slabs and Tight Bounds on the Number of Possible Answers

Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung +6

Let $S$ be a set of $n$ points in $R^{d}$ , where $d \geq 2$ is a constant, and let $H_{1}, H_{2}, \dots, H_{m + 1}$ be a sequence of vertical hyperplanes that are sorted by their fi…