R11/2
- Slide set
23
- Implementation III.
Notes:
- For more info on testing whether a point is in a polygon, see my note. Also see the comp.graphics.algorithms FAQ, question 2.03.
- The flood fill will fail if the interior is not connected. That happens when two close edges cause adjacent pixels to be set. It will also fail if there is a gap in the perimeter - the color will leak out.
- The scan line fill must handle special cases like a vertex being on a scan line. My solution is to pretend that any vertex on a scan line is really slightly above. This is a simple case of a serious technique called ''Simulation of Simplicity'' invented by Herbert Edelsbrunner.
- Slide set 24 - Buffers.
<< Lecture 15 | ComputerGraphicsFall2006 | Lecture 17 >>
Recent pages you've visited: (:tracetrails:)