Results 1 
3 of
3
NearLinear Approximation Algorithms for . . .
 SCG'09
, 2009
"... Given a set system (X, R), the hitting set problem is to find a smallestcardinality subset H ⊆ X, with the property that each range R ∈ R has a nonempty intersection with H. We present nearlinear time approximation algorithms for the hitting set problem, under the following geometric settings: (i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given a set system (X, R), the hitting set problem is to find a smallestcardinality subset H ⊆ X, with the property that each range R ∈ R has a nonempty intersection with H. We present nearlinear time approximation algorithms for the hitting set problem, under the following geometric settings: (i) R is a set of planar regions with small union complexity. (ii) R is a set of axisparallel drectangles in R d. In both cases X is either the entire ddimensional space or a finite set of points in dspace. The approximation factors yielded by the algorithm are small; they are either the same as or within an O(log n) factor of the best factors known to be computable in polynomial time.
NearLinear Approximation Algorithms for Geometric Hitting Sets
 SCG'09
, 2009
"... Given a set system (X, R), the hitting set problem is to find a smallestcardinality subset H ⊆ X, with the property that each range R ∈ R has a nonempty intersection with H. We present nearlinear time approximation algorithms for the hitting set problem, under the following geometric settings: (i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given a set system (X, R), the hitting set problem is to find a smallestcardinality subset H ⊆ X, with the property that each range R ∈ R has a nonempty intersection with H. We present nearlinear time approximation algorithms for the hitting set problem, under the following geometric settings: (i) R is a set of planar regions with small union complexity. (ii) R is a set of axisparallel drectangles in R d. In both cases X is either the entire ddimensional space or a finite set of points in dspace. The approximation factors yielded by the algorithm are small; they are either the same as or within an O(log n) factor of the best factors known to be computable in polynomial time.
Vis Comput DOI 10.1007/s0037101106450 ORIGINAL ARTICLE
, 2011
"... Creating building ground plans via robust Kway union A step toward largescale simulation in urban environment ..."
Abstract
 Add to MetaCart
Creating building ground plans via robust Kway union A step toward largescale simulation in urban environment