## Abstract

We present an efficient algorithm for the following problem: Given a collection T = {Δ_{1},..., Δ_{n}} of n triangles in the plane, such that there exists a subset s ⊂ T (unknown to us) of ξ ≪ n triangles, such that ∪_{Δ∈S} Δ = ∪_{Δ∈T} Δ construct efficiently the union of the triangles in T. We show that this problem can be solved in randomized expected time O(n^{4/3} log n + n∈ log^{2} n), which is subquadratic for ∈= o(n/log^{2}n). In our solution, we use a variant of the method of Brönnimann and Goodrich [Discrete Comput. Geom., 14 (1995), pp. 463-479] for finding a set cover in a set system of finite VC-dimension. We present a detailed implementation of this variant, which makes it run within the asserted time bound. Our approach is fairly general, and we show that it can be extended to compute efficiently the union of simply shaped bodies of constant description complexity in ℝ^{d}, when the union is determined by a small subset of the bodies.

Original language | English |
---|---|

Pages (from-to) | 1331-1351 |

Number of pages | 21 |

Journal | SIAM Journal on Computing |

Volume | 34 |

Issue number | 6 |

DOIs | |

State | Published - 2005 |

Externally published | Yes |

## Keywords

- Finite vc-dimension
- Hitting set
- Output sensitivity
- Random sampling
- Set cover
- Union of geometric objects
- ε-net