Arijit Bishnu
Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network.
Wed, 06/16/2010 - 15:01 — SomNambulAuthors: Arijit Bishnu, Dinesh Dash, Arobinda Gupta, Subhas C. Nandy
Subjects: Computational Geometry
AbstractThe 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 line segments in sensor networks. A line segment `
is said to be covered if it intersects the sensing regions of at least one
sensor distributed in that region. We show that the problem of ?nding the
minimum number of sensors needed to cover each member in a given set of line
segments in a rectangular area is NP-hard.On Finding Non-dominated Points using Compact Voronoi Diagrams.
Mon, 09/07/2009 - 22:13 — SomNambulAuthors: Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
Subjects: Computational Geometry
AbstractWe discuss in this paper a method of finding skyline or non-dominated points
in a set $P$ of $n_P$ points with respect to a set $S$ of $n_S$ sites. A point
$p_i \in P$ is non-dominated if and only if for each $p_j \in P$, $j \not= i$,
there exists at least one point $s \in S$ that is closer to $p_i$ than $p_j$.
We reduce this problem of determining non-dominated points to the problem of
finding sites that have non-empty cells in an additive Voronoi diagram with a
convex distance function.
User login
