Search for algorithm...
darken at gamca.sk
Mon Mar 12 22:05:26 PST 2001
Hi everybody !
I'm just a newbie in this mailing list so I am sorry
for my English and sorry if'll be asking questions witch
has obvious solutions...
I just wanted to ask you for algoritms solving this prob :
Given two convex polygons P,Q which have N,M vertexes, find
their "intersection" - (give vertexes of the polygon which
is their intersection).
I am searching for an algorithm which solves this problem
in linear time depending on N,M -> O(N+M)
Darken (darken at gamca.sk)
The compgeom mailing lists: see
or send mail to compgeom-request at research.bell-labs.com with the line:
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
More information about the Compgeom-announce