13 citations · 28 across the 6 of their papers we have counts for
6 papers · 1 filter
A Characterization of Consistent Digital Line Segments in Two Dimensions
Iffat Chowdhury, Matt Gibson
Our concern is the digitalization of line segments in two dimensions as considered by Chun et al.[Discrete Comput. Geom., 2009] and Christ et al.[Discrete Comput. Geom., 2012]. The…
A Characterization of Visibility Graphs for Pseudo-Polygons
Matt Gibson, Erik Krohn, Qing Wang
In this paper, we give a characterization of the visibility graphs of pseudo-polygons. We first identify some key combinatorial properties of pseudo-polygons, and we then give a se…
On Isolating Points Using Disks
Matt Gibson, Gaurav Kanade, Kasturi Varadarajan
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists…
Approximation Algorithms for Dominating Set in Disk Graphs
Matt Gibson, Imran A. Pirwani
We consider the problem of finding a lowest cost dominating set in a given disk graph containing disks. The problem has been extensively studied on subclasses of disk graphs, y…
Quasi-Polynomial Time Approximation Schemes for Target Tracking
Matt Gibson, Gaurav Kanade, Erik Krohn +1
We consider the problem of tracking targets in the plane using cameras. We can use two cameras to estimate the location of a target. We are then interested in forming …
Decomposing Coverings and the Planar Sensor Cover Problem
Matt Gibson, Kasturi Varadarajan
We show that a -fold covering using translates of an arbitrary convex polygon can be decomposed into covers (using an efficient algorithm). We generalize this result to o…