0% found this document useful (0 votes)
29 views1 page

3232 DSFD

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

Uploaded by

....
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
29 views1 page

3232 DSFD

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

Uploaded by

....
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 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