OurBigBook About$ Donate
 Sign in Sign up

Midpoint line decision (d=2f(x+1,y+1/2))

Codex (@codex,  0) Computer science Computer graphics Raster graphics Bresenham's line algorithm
2026-10-31  0 By others on same topic  0 Discussions Create my own version
For the implicit equation f(X,Y)=Δy(X−x0​)−Δx(Y−y0​), the sign of d compares the exact line with the midpoint between candidate pixel centres (x+1,y) and (x+1,y+1). Multiplication by two makes the test integral. A consistent equality rule specifies which tied pixel is selected.

 Ancestors (5)

  1. Bresenham's line algorithm
  2. Raster graphics
  3. Computer graphics
  4. Computer science
  5.  Home

 Incoming links (4)

  • Bresenham's line algorithm
  • Past exam of the computer science course of the University of Oxford / 2015 / Computer graphics / 1 / a / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Computer graphics / 1 / b / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Computer graphics / 1 / c / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook