Q1. Discuss the algorithm slowconvexhull and its time complexity. Q2. Discuss the incremental convexhull algorithm with its time complexity. Q3. Discuss the application areas of computational geometry. Q4. Discuss the application domains of Computational Geometry. Q5. Differentiate classical geometry & computational geometry. Q6. Discuss convex & concave in context of Computational Geometry. Q7. Define convex hull. Determine convex hull with an example. Q8. Prove that The convex hull of a set of n points in the plane can be computed in O(nlogn) time. Q9. Discuss the art gallery problem. Q10. What is Triangulation discuss with suitable example.