Polygon inside polygon

Tomas Berglund tb at sm.luth.se
Sun Feb 6 11:23:37 PST 2005

Dear all,

Thank you for your quick response. I will come back to you all soon. My 
next question is; can the complexity of the problem described in below 
be lowered if we know that both polygons are streets? How does an 
algorithm look like if this is the case?



Tomas Berglund wrote:
> Dear all,
> I am touching the problem of deciding whether a polygon is inscribed in 
> another polygon or not. Is there anyone who knows an effective algorithm 
>  that solves this problem? In case, what is the complexity of the 
> algorithm?
> Thanks for your time, respectfully,
> /Tomas

Tomas Berglund       |Office:          A3412|Cell.Ph. :+46 (0)706-770205
Div. Computer Science|URL:www.sm.luth.se/~tb|Home Ph. : +46 (0)920-68830
Lulea Univ. of Tech. |Ph.: +46 (0)920-492047|Home Adr.:    Bruksvagen 1A
S-97187 LULEA/SWEDEN |Fax: +46 (0)920-492831|       S-97594 LULEA/SWEDEN

The compgeom mailing lists: see
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.

More information about the Compgeom-announce mailing list