### Abstract

A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two vertices (see Figure 1). We describe a randomized algorithm that, given n points and an integer k ≥ 0, finds the minimum-width V-shape enclosing all but k of the points with probability 1 - 1/n^{c} for any c > 0, with expected running time O(cn^{2}(k + 1)^{4} log n(log n log log n + k)).

Original language | English (US) |
---|---|

Title of host publication | CCCG 2013 - 25th Canadian Conference on Computational Geometry |

Publisher | Canadian Conference on Computational Geometry |

Pages | 211-215 |

Number of pages | 5 |

State | Published - 2013 |

Event | 25th Canadian Conference on Computational Geometry, CCCG 2013 - Waterloo, Canada Duration: Aug 8 2013 → Aug 10 2013 |

### Other

Other | 25th Canadian Conference on Computational Geometry, CCCG 2013 |
---|---|

Country | Canada |

City | Waterloo |

Period | 8/8/13 → 8/10/13 |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology
- Computational Mathematics

### Cite this

*CCCG 2013 - 25th Canadian Conference on Computational Geometry*(pp. 211-215). Canadian Conference on Computational Geometry.

**How to cover most of a point set with a V-shape of minimum width.** / Aronov, Boris; Iacono, John; Özkan, Özgür; Yagnatinsky, Mark.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*CCCG 2013 - 25th Canadian Conference on Computational Geometry.*Canadian Conference on Computational Geometry, pp. 211-215, 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Canada, 8/8/13.

}

TY - GEN

T1 - How to cover most of a point set with a V-shape of minimum width

AU - Aronov, Boris

AU - Iacono, John

AU - Özkan, Özgür

AU - Yagnatinsky, Mark

PY - 2013

Y1 - 2013

N2 - A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two vertices (see Figure 1). We describe a randomized algorithm that, given n points and an integer k ≥ 0, finds the minimum-width V-shape enclosing all but k of the points with probability 1 - 1/nc for any c > 0, with expected running time O(cn2(k + 1)4 log n(log n log log n + k)).

AB - A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two vertices (see Figure 1). We describe a randomized algorithm that, given n points and an integer k ≥ 0, finds the minimum-width V-shape enclosing all but k of the points with probability 1 - 1/nc for any c > 0, with expected running time O(cn2(k + 1)4 log n(log n log log n + k)).

UR - http://www.scopus.com/inward/record.url?scp=84961370711&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84961370711&partnerID=8YFLogxK

M3 - Conference contribution

SP - 211

EP - 215

BT - CCCG 2013 - 25th Canadian Conference on Computational Geometry

PB - Canadian Conference on Computational Geometry

ER -