An Extension Of Weiler-Atherton Algorithm To Cope With The Self-intersecting Polygon

03/04/2014
by   Anurag Chakraborty, et al.
0

In this paper a new algorithm has been proposed which can fix the problem of Weiler Atherton algorithm. The problem of Weiler Atherton algorithm lies in clipping self intersecting polygon. Clipping self intersecting polygon is not considered in Weiler Atherton algorithm and hence it is also a main disadvantage of this algorithm. In our new algorithm a self intersecting polygon has been divided into non self intersecting contours and then perform the Weiler Atherton clipping algorithm on those sub polygons. For holes we have to store the edges that is not own boundary of hole contour from recently clipped polygon. Thus if both contour is hole then we have to store all the edges of the recently clipped polygon. Finally the resultant polygon has been produced by eliminating all the stored edges.

READ FULL TEXT

page 6

page 7

research
10/28/2021

CIIA:A New Algorithm for Community Detection

In this paper, through thinking on the modularity function that measures...
research
08/18/2019

A New Fast Computation of a Permanent

This paper proposes a general algorithm called Store-zechin for quickly ...
research
06/01/2020

Self-stabilizing Algorithm for Minimal α-Dominating Set

A self-stabilizing algorithm for the minimal α-dominating set is propose...
research
06/14/2018

From Self-ception to Image Self-ception: A method to represent an image with its own approximations

A concept of defining images based on its own approximate ones is propos...
research
03/28/2020

Using the Split Bregman Algorithm to Solve the Self-Repelling Snake Model

Preserving the contour topology during image segmentation is useful in m...
research
06/29/2020

An enhanced finite difference time domain method for two dimensional Maxwell's equations

An efficient finite-difference time-domain (FDTD) algorithm is built to ...
research
12/27/2021

Algorithm for recognizing the contour of a honeycomb block

The article discusses an algorithm for recognizing the contour of fragme...

Please sign up or login with your details

Forgot password? Click here to reset