Question 21 : The most important condition for which closest pair is calculated for the points (p_i, p_j) is?
1. i>j
2. i!=j
3. i=j
4. i<j
View Answer   Discuss with Members

Question 22 : Which of the following statement is not related to quickhull algorithm?
1. finding points with minimum and maximum coordinates
2. dividing the subset of points by a line
3. eliminating points within a formed triangle
4. finding the shortest distance between two points
View Answer   Discuss with Members

Question 23 : What is the running time of Hershberger algorithm?
1. O(log n)
2. O(n log n)
3. O(n log h)
4. O(log h)
View Answer   Discuss with Members

Question 24 : ___________ is a method of constructing a smallest polygon out of n given points.
1. closest pair problem
2. quick hull problem
3. path compression
4. union-by-rank
View Answer   Discuss with Members

Question 25 : Which of the following is called the 'ultimate planar convex hull algorithm'?
1. Chan's algorithm
2. Kirkpatrick-Seidel algorithm
3. Gift wrapping algorithm
4. Jarvis algorithm
View Answer   Discuss with Members

Question 26 : Who formulated Chan's algorithm?
1. Timothy
2. Kirkpatrick
3. Frank Nielsen
4. Seidel
View Answer   Discuss with Members

Question 27 : Chan's algorithm can be used to compute the lower envelope of a trapezoid.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 28 : Who formulated quick hull algorithm?
1. Eddy
2. Andrew
3. Chan
4. Graham
View Answer   Discuss with Members

Question 29 : How many approaches can be applied to solve quick hull problem?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 30 : Which of the following factors account more to the cost of Chan's algorithm?
1. computing a single convex hull
2. locating points that constitute a hull
3. computing convex hull in groups
4. merging convex hulls
View Answer   Discuss with Members