CGAL users discussion list

[apurba das <>]

Hi,

I have already implemented the union of multiple simple polygons whose
vertices are real numbers. I have considered the outer faces of all
the polygons and defined walk on the edges of the polygons as inside
and outside incrementally. The output of my program is the union of
polygons and the holes (described by the polygons) as a result of the
union. But the thing is that I have implemented in C without using
CGAL. The complexity of my algorithm is O(n^k) if there are k simple
polygons with n edges each.

Thanks and Regards,

Apurba Das
B.E (Computer Science), M.Tech(Computer Science)
Software Developer (Wireless 3G) at Ixia Technologies

On 1/24/12, pgiitu 
<>
 wrote:
> Thanks....
>
> --
> View this message in context:
> http://cgal-discuss.949826.n4.nabble.com/Union-of-multiple-Polygons-tp4304621p4322955.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>
>


-- 
-----------------
Apurba Das
M.Tech (Computer Science)
Indian Statistical Institute, kolkata
India