Bresenham's 3D Line algorithm
by Jean Chaoui
21 Nov 2007
(Updated 26 Nov 2007)
The Bresenham line algorithm provides points in a 3-dimensional Matrix which form a close approximat
|
Watch this File
|
| File Information |
| Description |
The Bresenham line algorithm is an algorithm that determines which points in a 3-dimensional raster should be plotted in order to form a close approximation to a straight line between two given points in 3D space.
The common conventions that pixel coordinates increase in the down and right directions and that pixel centers have integer coordinates will be used. The endpoints of the line are the pixels at (x0, y0, z0) and (x1, y1,z1), where the first coordinate of the pair is the column, the second is the row and the third is the slice. |
| MATLAB release |
MATLAB 7 (R14)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Comments and Ratings (4) |
| 09 Dec 2007 |
The Golden Eye
|
|
|
| 30 Dec 2007 |
won Ting
|
|
|
| 07 Mar 2008 |
Ahmad ALMHDIE
|
|
|
| 18 Mar 2008 |
jean Chaoui
|
|
|
|
Contact us at files@mathworks.com