MCQOPTIONS
Saved Bookmarks
| 1. |
Which of the following is called the 'ultimate planar convex hull algorithm'? |
| A. | Chan's algorithm |
| B. | Kirkpatrick-Seidel algorithm |
| C. | Gift wrapping algorithm |
| D. | Jarvis algorithm |
| Answer» C. Gift wrapping algorithm | |