Scribd
Upload
83 views2 pages

Algo Assignment

This document contains instructions for Assignment #06 which is due on May 9th, 2014 and includes 4 questions. Question 1 asks to prove a theorem about the orientation of 3 points in a plane from a textbook. Question 2 asks to draw a quadtree for a set of 9 points within a 16x16 bounding box. Question 3 asks to construct a k-d tree for the same point set from Question 2. Question 4 asks to write an algorithm in C/C++ to find the shortest path between a start and target point while avoiding an obstacle polygon, and test it on different point sets.

Uploaded by

Muhammad Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
83 views2 pages

Algo Assignment

This document contains instructions for Assignment #06 which is due on May 9th, 2014 and includes 4 questions. Question 1 asks to prove a theorem about the orientation of 3 points in a plane from a textbook. Question 2 asks to draw a quadtree for a set of 9 points within a 16x16 bounding box. Question 3 asks to construct a k-d tree for the same point set from Question 2. Question 4 asks to write an algorithm in C/C++ to find the shortest path between a start and target point while avoiding an obstacle polygon, and test it on different point sets.

Uploaded by

Muhammad Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Algorithm Design and Analysis

(Spring 2014)

Assignment # 06

Distribution Date: 01-05-2014 Due Date: 09-05-2014

Question 01:
Provide a complete proof of Theorem 12.8 ( Chapter 12; Goodrich book), Theorem
is given below;
The orientation of a triplet (p1,p2, p3) of points in the plane is counterclockwise,
clockwise, or collinear, depending on whether (p1,p2, p3) is positive, negative, or
zero, respectively

Question 02:
Draw a quadtree for the following set of points, assuming a 16 x 16 bounding box:
{(1, 2), (4, 10), (14,3), (6,6), (3, 15), (2,2), (3, 12), (9,4), (12, 14)}.

Question 03:
Construct a k-d tree for the point set of Q2.

Question 04:
You are required to write an algorithm to solve the robot motion planning problem
(application of convex hull). In given problem, it is required to identify a trajectory
from a start point s to a target point t that avoids a certain obstacle. Among the
many possible trajectories, we would like to find one that is as short as possible.
(Assume obstacle as polygon P). Implement your algorithm in C/C++ and test your
results for different set of points (x,y).

You might also like