The document discusses algorithms related to computational geometry, specifically focusing on the divide and conquer strategy to solve problems involving points and polygons. It outlines methods for sorting points and determining upper and lower hulls, as well as the recursive approach to manage these geometrical constructs. Additionally, it touches on the efficiency and complexity of the proposed algorithms in handling geometric data.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0 ratings0% found this document useful (0 votes)
7 views7 pages
DAA Assignment 2
The document discusses algorithms related to computational geometry, specifically focusing on the divide and conquer strategy to solve problems involving points and polygons. It outlines methods for sorting points and determining upper and lower hulls, as well as the recursive approach to manage these geometrical constructs. Additionally, it touches on the efficiency and complexity of the proposed algorithms in handling geometric data.