MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Graphics Questions & Answers Other Polygon Clipping Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following clipping algorithm is based upon the inside of a polygon based on the winding number? |
| A. | Sutherland Hodgman Clipping Algorithm |
| B. | Weiler Atherton Clipping Algorithm |
| C. | Vatti Clipping Algorithm |
| D. | Greiner Hormann Clipping Algorithm |
| Answer» E. | |
| 2. |
Which of the following algorithm can be used to clip a polygon in 3D space? |
| A. | Weiler Atherton Algorithm |
| B. | Vatti Clipping Algorithm |
| C. | Greiner Hormann Clipping Algorithm |
| D. | Polygon in 3D space cannot be clipped |
| Answer» B. Vatti Clipping Algorithm | |
| 3. |
Greiner Hormann Clipping Algorithm is more efficient than the Vatti Clipping Algorithm. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
Vatti Clipping Algorithm uses the sweep line approach to clip a polygon. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 5. |
Which of the following algorithm can be used to clip a self-intersecting polygon? |
| A. | Greiner Hormann Clipping Algorithm |
| B. | Weiler Atherton Clipping Algorithm |
| C. | Vatti Clipping Algorithm |
| D. | Both Vatti and Greiner Hormann Clipping Algorithm |
| Answer» E. | |
| 6. |
In Weiler Atherton Clipping Algorithm which of the following is consider to clip a polygon? |
| A. | Polygon edges and Window boundaries |
| B. | Polygon Vertices |
| C. | Polygon Edges |
| D. | Window boundaries |
| Answer» E. | |
| 7. |
Which of the following polygon clipping algorithm can be used to clip a filled area? |
| A. | Sutherland Hodgman Clipping Algorithm |
| B. | Weiler Atherton Clipping Algorithm |
| C. | Vatti Clipping Algorithm |
| D. | Greiner Hormann Clipping Algorithm |
| Answer» C. Vatti Clipping Algorithm | |
| 8. |
Which of the following part of a polygon is considered in a polygon clipping algorithm? |
| A. | Part which is both inside and outside the window |
| B. | Part which is outside the window |
| C. | Part which is inside the window |
| D. | Part which is neither inside nor outside the window |
| Answer» D. Part which is neither inside nor outside the window | |
| 9. |
A polygon can be a figure whose all edges are not connected with another edge. |
| A. | True |
| B. | False |
| Answer» C. | |
| 10. |
How many types of basic polygons are present? |
| A. | 4 |
| B. | 2 |
| C. | 10 |
| D. | 5 |
| Answer» C. 10 | |