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.
Pads any amount of images each to power-of-two dimensions, useful for OpenGL programming.
Given starting and ending points returns list of coordinates as per Bresenham's line algorithm. I wrote this a long time ago under Matlab 4.x I think. It works under Matlab 5.3 and 6.1. I have not reviewed the code since I wrote it.
The BalanceLine4j Project is an implementation of the Balance Line Algorithm for Java applications. The Balance Line is an algorithm used to make Coordinated Processing and Sequential Updates, that improves performance and saves machine resources.
Command line utility for programming the internal flash in NXP arm processors using the ISP protocol in the built-in bootloader. Lots of processors are supported and it is easy to add more.
gloost is an free software, platform independent framework for OpenGL programming. Find the current version at https://sourceforge.net/projects/gloost/
Given start and end point, produce a list of points through which line (or ray) will traverse.
This program will generate the coordinates of a 3D Bresenham's raster line between two given points.
A very useful application of this algorithm can be found in the implementation of Fischer's Bresenham interpolation method in my...
Users or programmers who are interested in C++ programming can be benefited by using this site. This site offer many online forums, tips and tutorials for C++ programming and users can interact with others using this forum and can discuss about...
This is a normal label with a link to ie function.you can place a normal label with a caption an when pressing the label internet explorer will popup and show the link wich you included into the label.
With this component you can read and write the windows Registry and a find to check if a key exists.
DDA algorithm uses fast interpolation and rounding method to implement rasterization of lines, triangle and polygons. This technique has been used here to produce a straight line.
SpeedyGA is a vectorized implementation of a genetic algorithm in the Matlab programming language. Without bells and whistles, it faithfully implements the specification for a Simple GA given on pgs 10, 11 of M. Mitchell's GA book. See comments in...
This is an implementation of the binary search algorithm in (almost) one line. Given a number 'n' and a list 'L', the function returns the index of the number on the list, or -1.
The Genetic Algorithm Utility Library (or, GAUL for short) is a flexible programming library designed to aid in the development of applications that use genetic, or evolutionary, algorithms. It provides data structures and functions for handling...
This simple simulation shows the implementation of FxLMS algorithm for a single channel feed-forward active noise control system. Here, the controller generates an "anti-noise" signal to result a destructive interference at the sensor...
The problem of fitting a straight line to data with uncertainties in both coordinates is solved using a weighted total least-squares algorithm. The parameters are transformed from the usual slope/y-axis intersection pair to slope angle and...
This function solves the mixed integer linear programming problems. It uses the linprog.m function that comes with the optimization toolbox of MATLAB. It employs the branch and bound algorithm. It uses depth first search
An efficient algorithm for identification of strong polarity-inversion line (SPIL) on Solar Dynamic Observatory (SDO) Helioseismic and Magnetic Imager (HMI) magnetograms.
Detailed description will appear in the paper: Volobuev, D.M....
dpsimplify uses the recursive Douglas-Peucker line simplification algorithm to reduce the number of vertices in a polyline according to a specified tolerance. The algorithm is also know as Iterative Endpoint Fit algorithm. dpsimplify can handle... |