Algorithm::Line::Bresenham::C

It is a C version Algorithm::Line::Bresenham to speed up a bit
Download

Algorithm::Line::Bresenham::C Ranking & Summary

Advertisement

  • Rating:
  • License:
  • Perl Artistic License
  • Price:
  • FREE
  • Publisher Name:
  • Lilo Huang
  • Publisher web site:
  • http://search.cpan.org/~kenwu/

Algorithm::Line::Bresenham::C Tags


Algorithm::Line::Bresenham::C Description

It is a C version Algorithm::Line::Bresenham to speed up a bit Algorithm::Line::Bresenham::C is a C version Algorithm::Line::Bresenham to speed up a bit.SYNOPSIS use Algorithm::Line::Bresenham::C qw/line/; my @points = line(3,3 => 5,0); # returns the list: , , , Bresenham is one of the canonical line drawing algorithms for pixellated grids. Given a start and an end-point, Bresenham calculates which points on the grid need to be filled to generate the line between them.Googling for 'Bresenham', and 'line drawing algorithms' gives some good overview. The code here takes its starting point from Mark Feldman's Pascal code in his article Bresenham's Line and Circle Algorithms at http://www.gamedev.net/reference/articles/article767.asp. Requirements: · Perl


Algorithm::Line::Bresenham::C Related Software

About SoftwareSea