Scribd Logo
Upload

Welcome to Scribd!

  • DSSSSD

    Uploaded by

    ....
    11 views1 page
    The document discusses computing the minimum distance between segments of two shapes and that the cost will be zero for edges entering a goal. It also mentions different bridges connecting two islands.

    Original Description:

    fsdf dfsd af sdaf sad

    Original Title

    dssssd

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses computing the minimum distance between segments of two shapes and that the cost will be zero for edges entering a goal. It also mentions different bridges connecting two islands.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    11 views1 page

    DSSSSD

    Uploaded by

    ....
    The document discusses computing the minimum distance between segments of two shapes and that the cost will be zero for edges entering a goal. It also mentions different bridges connecting two islands.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    aph. ...

    distance DX,Y can be computed as the minimum of all distances between a


    segment P in X and a segment ... For edges entering the goal the cost willobviously be
    zero. ...... different bridges connecting islands 2 and 7.

    You might also like