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

Boris Aronov, John Iacono, Özgür Özkan, Mark Yagnatinsky

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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/nc for any c > 0, with expected running time O(cn2(k + 1)4 log n(log n log log n + k)).

    Original languageEnglish (US)
    Title of host publicationCCCG 2013 - 25th Canadian Conference on Computational Geometry
    PublisherCanadian Conference on Computational Geometry
    Pages211-215
    Number of pages5
    StatePublished - 2013
    Event25th Canadian Conference on Computational Geometry, CCCG 2013 - Waterloo, Canada
    Duration: Aug 8 2013Aug 10 2013

    Other

    Other25th Canadian Conference on Computational Geometry, CCCG 2013
    CountryCanada
    CityWaterloo
    Period8/8/138/10/13

    Fingerprint

    Point Sets
    Cover
    Randomized Algorithms
    Half line
    Figure
    Integer

    ASJC Scopus subject areas

    • Geometry and Topology
    • Computational Mathematics

    Cite this

    Aronov, B., Iacono, J., Özkan, Ö., & Yagnatinsky, M. (2013). How to cover most of a point set with a V-shape of minimum width. In 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.

    CCCG 2013 - 25th Canadian Conference on Computational Geometry. Canadian Conference on Computational Geometry, 2013. p. 211-215.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aronov, B, Iacono, J, Özkan, Ö & Yagnatinsky, M 2013, How to cover most of a point set with a V-shape of minimum width. in 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.
    Aronov B, Iacono J, Özkan Ö, Yagnatinsky M. How to cover most of a point set with a V-shape of minimum width. In CCCG 2013 - 25th Canadian Conference on Computational Geometry. Canadian Conference on Computational Geometry. 2013. p. 211-215
    Aronov, Boris ; Iacono, John ; Özkan, Özgür ; Yagnatinsky, Mark. / How to cover most of a point set with a V-shape of minimum width. CCCG 2013 - 25th Canadian Conference on Computational Geometry. Canadian Conference on Computational Geometry, 2013. pp. 211-215
    @inproceedings{a665ecd1d93148a5bdb235cfe4dab611,
    title = "How to cover most of a point set with a V-shape of minimum width",
    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/nc for any c > 0, with expected running time O(cn2(k + 1)4 log n(log n log log n + k)).",
    author = "Boris Aronov and John Iacono and {\"O}zg{\"u}r {\"O}zkan and Mark Yagnatinsky",
    year = "2013",
    language = "English (US)",
    pages = "211--215",
    booktitle = "CCCG 2013 - 25th Canadian Conference on Computational Geometry",
    publisher = "Canadian Conference on Computational Geometry",

    }

    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 -