Skip to content

Implementation of bresenham's alogirthm in Factor

Notifications You must be signed in to change notification settings

Capital-EX/bresenham

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Bresenham

An implementation of Bresenham's Line Algorithm written in Factor. The bresenham word takes two points and returns a sequences of { x y } pairs representing each point on the line.

Example of Usage

{ 0 0 } { 4 9 } bresenham 
{
    { 0 0 }
    { 0 1 }
    { 1 2 }
    { 1 3 }
    { 2 4 }
    { 2 5 }
    { 3 6 }
    { 3 7 }
    { 4 8 }
    { 4 9 }
}

About

Implementation of bresenham's alogirthm in Factor

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages