mcq 队列_MCQ | 计算机图形学中的线填充算法

mcq 队列

Question 1: Which of the following methods is the fastest pixel position calculating method?

问题1：以下哪种方法是最快的像素位置计算方法？

1. Bressenham's line algorithm

   布雷森纳姆线算法

2. DDA line algorithm

   DDA线算法

3. Mid-point algorithm

   中点算法

4. None of the above

   以上都不是

Answer: d. DDA line algorithm

答案：d。 DDA线算法

Explanation:

说明：

The DDA is the fastest algorithm among the given algorithms for calculating the position of the pixels because it has a very easy formula or way to calculate which can be readily implemented and executed in programs.

DDA是给定算法中用于计算像素位置的最快算法，因为它具有非常容易的公式或计算方式，可以很容易地在程序中实现和执行。

---

---

Question 2: Which of the following line algorithms best balances the processing load among all the processers?

问题2：以下哪条生产线算法最能平衡所有处理器之间的处理负载？

1. Parallel line algorithm

   平行线算法

2. DDA line algorithm

   DDA线算法

3. Both a. and b. balances the load equally

   两者都 和b。 均衡负载

4. None of the above

   以上都不是

Answer: a. Parallel line algorithm

答： 平行线算法

Explanation:

说明：

If a parallel line algorithm has 'n' processes then this algorithm divides it into a number of partitions and generates line segments. Thus the load on the processors gets divided.

如果并行线算法具有“ n”个处理，则此算法将其划分为多个分区并生成线段。 因此，处理器上的负载被分割了。

---

---

 Question 3: Consider the following statement:

问题3：请考虑以下陈述：

"The boundary is specified in a single color, and the algorithm proceeds pixel by pixel until the boundary color is encountered."

“边界是用单一颜色指定的，算法逐像素进行处理，直到遇到边界颜色为止。”

The above statement defines which of the following algorithms?

上面的陈述定义了以下哪种算法？

1. Scan-line fill algorithm

   扫描线填充算法

2. Boundary-fill algorithm

   边界填充算法

3. Entire fill algorithm

   整个填充算法

4. Slide curve algorithm

   滑动曲线算法

Answer: b) Boundary-fill algorithm

答案：b)边界填充算法

Explanation:

说明：

Mainly, this algorithm proceeds outward pixel by pixel until the boundary color is encountered. Hence, the given statement definition correctly defines the Boundary fill algorithm.

主要是，此算法逐像素向外进行，直到遇到边界颜色为止。 因此，给定的语句定义正确定义了边界填充算法。

---

---

Question 4: In Bressenham’s line algorithm, there are certain conditions for deciding the successive parameters. Of the distances d1 < d2 then decision parameter Pk is which of the following?

问题4：在布雷森纳姆(Bressenham)的直线算法中，确定连续参数有一定条件。 在距离d1 <d2中，决策参数Pk是以下哪个？

1. Positive

   正

2. Equal

   等于

3. Negative

   负

4. Can be any of the above

   可以是以上任何一个

Answer: c. Negative

答：c。 负

Explanation:

说明：

If d1 < d2 then the decision variable is always negative.ie. Pk is always negative.

如果d1 <d2，则决策变量始终为负。 Pk始终为负。

---

---

Question 5: The term "DDA" in the DDA algorithm stands for:

问题5：DDA算法中的术语“ DDA”代表：

1. Digital difference analyzer

   数字差异分析仪

2. Direct differential analyzer

   直接差分分析仪

3. Digital differential analyzer

   数字差分分析仪

4. Data differential analyzer

   数据差分分析仪

Answer: c. Digital differential analyzer

答：c。 数字差分分析仪

Explanation:

说明：

DDA stands for Digital differential analyzer which is use to draw a line.

DDA代表数字差分分析仪，用于画线。

---

---

翻译自: https://www.includehelp.com/computer-graphics/mcq-line-filling-algorithms.aspx

mcq 队列