I am just stuck at_ HLD technique_ and the also the Dynamic tree . I am fair enough good at LCA but I feel helpless at dynamic changes in tree . I want to understand how to code and where to update for different Queries . Thanks in advance ..

Can anyone give me the code of polygon clipping .. I have heard the algorithm called cohen sutherland . Or is there any other idea or soltution to find polygon polygon intersection points ? It would be helpful if someone provide the code..

thanx in advance :)