This code implements Bresenham Line Algorithm with slight modification of error term in respect of computation efficiency that it does not require any division process. Hence it is more efficient. Also it has been generalized to draw lines of any slope. Point input order is thus insignificant. I hope this code would be helpful.
Kruskal's algorithm is used to find the branches of a ''tree'' having the minimum weight in a system of branches. The application of this algorithm is wide. One example is in finding the shortest (and cheapest) path of interconnecting several...
Compute the distance map to a set of points using the fast marching algorithm.
Solves the 2-D eikonal PDE.
This new algorithm automatically obtains the true colocalization in a pair of fluorescence confocal images.
The algorithm was integrated in a graphical users interface (GUI_COLOC).
The rationale of the algorithm has been submitted for...
The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point.
Porter Stemming Algorithm is a very simple utility that works on a algorithm which can reduce english words to their word stems - without the "ing", "ings";"s" etc., This scrpt is very useful for Search engine...
General hash function algorithm implementations for series of commonly used additive and rotative string hashing in the object pascal programming language.For more information please visit:http://www.partow.net/programming/hashfunctions/index.html
Unique image comparison algorithm implemented as standalone dll file. It has only one exported function with two bitmap pointers in and similarity percentage out.
Encryption is the process of transforming information or data using an algorithm to make it unreadable to anyone except those who implements it, usually referred to as a key. In our case in order to add more security we add with a constant number....
This algorithm converts a base c number into a base b number. Parameters c and b are arbitrary are not constrained by any bounds. The input n is a list and the output is a list.
Draws a random Bezier Curve using De Casteljau algorithm.
The algorithm is based on the idea
that the next larger prime after one prime is the sum of the two smaller previous minus three prime numbers back.
For the first five prime numbers 2,3,5,7,11 this pattern is not true also it is not...
sieve-of-eratosthenes algorithm with efficient scaling for big numbers.
Algorithm for solving search and optimization problems.
Finds the nth prime without using a sieve algorithm.
The recipe illustrates a Python implementation of the bitsort algorithm. This algorithm is illustrated in the book "Programming Pearls" by Jon Bentley. The bitsort algorithm provides a very efficient way to sort large numbers in disk files.
An implementation of the token bucket algorithm in Python.
A classic algorithm which can produce entertaining output, given a sufficiently large input
An algorithm to numerically invert functions in the Laplace field is presented.
It is based on the Fast Fourier Transform (FFT) technique and yields a
numerical solution for t=a ("a" is a real number) for a Laplace function