
A New Fast Computation of a Permanent
This paper proposes a general algorithm called Storezechin for quickly ...
read it

Selfstabilizing Algorithm for Minimal αDominating Set
A selfstabilizing algorithm for the minimal αdominating set is propose...
read it

From Selfception to Image Selfception: A method to represent an image with its own approximations
A concept of defining images based on its own approximate ones is propos...
read it

A Parallel Algorithm for Dilated Contour Extraction from Bilevel Images
We describe a simple, but efficient algorithm for the generation of dila...
read it

Using the Split Bregman Algorithm to Solve the SelfRepelling Snake Model
Preserving the contour topology during image segmentation is useful in m...
read it

An enhanced finite difference time domain method for two dimensional Maxwell's equations
An efficient finitedifference timedomain (FDTD) algorithm is built to ...
read it

PhotoSketching: Inferring Contour Drawings from Images
Edges, boundaries and contours are important subjects of study in both c...
read it
An Extension Of WeilerAtherton Algorithm To Cope With The Selfintersecting Polygon
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
Comments
There are no comments yet.