3 citations · 7 across the 5 of their papers we have counts for
5 papers
Morphing tree drawings in a small 3D grid
Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina
We study crossing-free grid morphs for planar tree drawings using 3D. A morph consists of morphing steps, where vertices move simultaneously along straight-line trajectories at con…
Maximum Rectilinear Crossing Number of Uniform Hypergraphs
Rahul Gangopadhyay, Ayan
We improve the lower bound on the -dimensional rectilinear crossing number of the complete -uniform hypergraph having vertices to $Ω\left(\dfrac{(4\sqrt{2}/3^{3/4})^d}{d…
-Sets and Rectilinear Crossings in Complete Uniform Hypergraphs
Rahul Gangopadhyay, Saswata Shannigrahi
In this paper, we study the -dimensional rectilinear drawings of the complete -uniform hypergraph . Anshu et al. [Computational Geometry: Theory and Applications, 2…
Rectilinear Crossings in Complete Balanced d-Partite d-Uniform Hypergraphs
Rahul Gangopadhyay, Saswata Shannigrahi
In this paper, we study the embedding of a complete balanced -partite -uniform hypergraph with all its vertices represented as points in general position in $\mathbb{R}^…
On the Rectilinear Crossing Number of Complete Uniform Hypergraphs
Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi +1
In this paper, we consider a generalized version of the rectilinear crossing number problem of drawing complete graphs on a plane. The minimum number of crossing pairs of hyperedge…