Implement Boolean operations like Union,Intersection and difference by creating two planar sub-divisons using C++

Input : A set of vertices and half edges to make it a planar subdivision.
Output : Should be the Union,Intersection and difference of two planar sub-divisons.
Data Structure using DCEL (Doubly Connected edge list).

Refer .Mark de Berg Computation Geometry book Sec2.4, Overlay algorithm at Pg.38