I need some help for a project I am working on. The problem is as follows
Given two simple polygons A & B of any shape with or without holes how do
we compute the union , intersection and A-B or B-A . If anybody could point
me towards some good literature or better still some source codeI would
really appreciate it.
Thanks a lot
This archive was generated by hypermail 2.1.2 : Tue Jun 05 2001 - 22:39:24 EEST