Scribd Logo
Importer

Bienvenue sur Scribd !

  • Summer Project: Arkaprava Paul

    Transféré par

    arkaprava paul
    4 vues11 pages
    Arkaprava Paul proposes a summer project to minimize the maximum distance between horizontal line segments and a set of k lines selected from 2n total lines. The input is n horizontal segments, each with a horizontal and vertical line. The goal is to select k lines to minimize the furthest distance between any segment and line. There are O(n^2) possible assignments to evaluate due to n horizontal and vertical lines each having n possible distances.

    Description originale:

    GFHGFHGH

    Titre original

    Document

    Copyright

    © © All Rights Reserved

    Formats disponibles

    PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    Arkaprava Paul proposes a summer project to minimize the maximum distance between horizontal line segments and a set of k lines selected from 2n total lines. The input is n horizontal segments, each with a horizontal and vertical line. The goal is to select k lines to minimize the furthest distance between any segment and line. There are O(n^2) possible assignments to evaluate due to n horizontal and vertical lines each having n possible distances.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    4 vues11 pages

    Summer Project: Arkaprava Paul

    Transféré par

    arkaprava paul
    Arkaprava Paul proposes a summer project to minimize the maximum distance between horizontal line segments and a set of k lines selected from 2n total lines. The input is n horizontal segments, each with a horizontal and vertical line. The goal is to select k lines to minimize the furthest distance between any segment and line. There are O(n^2) possible assignments to evaluate due to n horizontal and vertical lines each having n possible distances.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 11

    Summer Project

    Arkaprava Paul

    Ramakrishna Mission Vivekananda Education


    and Research Institute

    October 19, 2019


    Problem

    • Input : Given n horizontal segments of unit length, for each


    segment , we have one horizontal line along this segment, and
    a vertical line which is a ⊥ bisector of this segment. ∴ We
    have 2n lines in total.
    Problem

    • Input : Given n horizontal segments of unit length, for each


    segment , we have one horizontal line along this segment, and
    a vertical line which is a ⊥ bisector of this segment. ∴ We
    have 2n lines in total.
    • Output: We select k lines such that the maximum distance of
    a segment from a line is minimized.
    Problem

    • Input : Given n horizontal segments of unit length, for each


    segment , we have one horizontal line along this segment, and
    a vertical line which is a ⊥ bisector of this segment. ∴ We
    have 2n lines in total.
    • Output: We select k lines such that the maximum distance of
    a segment from a line is minimized.
    Distance : The distance of a horizontal segment from a vertical
    line is the difference in the x co-ordinates. The distance of a
    horizontal segment from a horizontal line is the difference in the y
    co-ordinates.
    Problem

    • Input : Given n horizontal segments of unit length, for each


    segment , we have one horizontal line along this segment, and
    a vertical line which is a ⊥ bisector of this segment. ∴ We
    have 2n lines in total.
    • Output: We select k lines such that the maximum distance of
    a segment from a line is minimized.
    Distance : The distance of a horizontal segment from a vertical
    line is the difference in the x co-ordinates. The distance of a
    horizontal segment from a horizontal line is the difference in the y
    co-ordinates.
    Example Input
    A Possible assignment for n=8 and k=5
    All 2n lines
    Observations
    • , There are O(n2 ) possibilities for r
    Observations
    • , There are O(n2 ) possibilities for r
    Observations

    n
    
    There are 2n lines , for the n horizontal lines there are 2  possible
    n
    distances and similarly for the n vertical lines there are 2 possible
    distances.
    Therefore total possibilities are (n × (n − 1)) ≈ O(n2 ).

    Vous aimerez peut-être aussi