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.
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 ratings0% 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.