Fill-Area Primitives Flashcards

0
Q

What is a polygon?

A

A set of points interpreted as edges in a shape.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
1
Q

What is boundary fill?

A

Look at each neighbor and check to see if its boundary if not fill and continue. This is recursive so it does first case over and over first.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a convex polygon?

A

All of the interior angles are less than 180 degrees.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is a concave polygon?

A

A polygon with interior angles greater than 180 degrees.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is a complex polygon?

A

A polygon with self intersecting lines.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What are the special cases for line fill?

A

If the point is y min or y max. Count it twice.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What values do you need to track for the line fill algorithm?

A

Ymin ymax x 1/m

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the scan line fill algorithm?

A
  1. Initialize edges
  2. Active edges
  3. Start at lowest point
How well did you know this?
1
Not at all
2
3
4
5
Perfectly