J. De Carufel

activity

20242026

collaborators

4 papers

cs.CG2026

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…

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…

cs.CG2024

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults

Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari +1

Let $H$ be an edge-weighted graph, and let $G$ be a subgraph of $H$ . We say that $G$ is an $f$ -fault-tolerant $t$ -spanner for $H$ , if the following is true for any subset $F$ of at…

math.CO2024

So Long Sucker: Endgame Analysis

Jean-Lou De Carufel, Marie Rose Jerade

So Long Sucker is a strategy board game that requires 4 players, each with $c$ chips of their designated color, and a board made of $k$ empty piles. With a clear set-up comes intri…