20 citations · 31 across the 15 of their papers we have counts for
7 papers · 1 filter
On the streaming complexity of fundamental geometric problems
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra +1
In this paper, we focus on lower bounds and algorithms for some basic geometric problems in the one-pass (insertion only) streaming model. The problems considered are grouped into…
Grid Obstacle Representation of Graphs
Arijit Bishnu, Arijit Ghosh, Rogers Mathew +2
The grid obstacle representation, or alternately, -obstacle representation of a graph is an injective function and a set of point o…
Uniformity of point samples in metric spaces using gap ratio
Arijit Bishnu, Sameer Desai, Arijit Ghosh +2
Teramoto et al. defined a new measure called the gap ratio that measures the uniformity of a finite point set sampled from , a bounded subset of . We generali…
On Packing Almost Half of a Square with Anchored Rectangles: A Constructive Approach
Sandip Banerjee, Aritra Banik, Bhargab B. Bhattacharya +2
In this paper, we consider the following geometric puzzle whose origin was traced to Allan Freedman \cite{croft91,tutte69} in the 1960s by Dumitrescu and T{ó}th \cite{adriancasaba2…
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon
Arijit Bishnu, Subir Kumar Ghosh, Partha Pratim Goswami +2
Let be a source point and be a destination point inside an -vertex simple polygon . Euclidean shortest paths and minimum-link paths between and inside hav…
Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network
Dinesh Dash, Arijit Bishnu, Arobinda Gupta +1
The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of…
Computation of Spatial Skyline Points
Binay Bhattacharya, Arijit Bishnu, Otfried Cheong +3
We discuss a method of finding skyline or non-dominated sites in a set of point sites with respect to a set of points. A site is non-dominated if and only…