Saurabh Ray

collaborators

2 papers

cs.CG2024

A fast algorithm for computing a planar support for non-piercing rectangles

Ambar Pal, Rajiv Raman, Saurabh Ray +1

For a hypergraph $H = (X, E)$ a \emph{support} is a graph $G$ on $X$ such that for each $E \in E$ , the induced subgraph of $G$ on the elements in $E$ is co…

cs.CG2024

Sweeping Arrangements of Non-Piercing Curves in Plane

Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman +1

Let $Γ$ be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve $γ \in Γ$ , we denote the bounded region enclosed by $γ$ as $γ ~$ .…