Given an array of \(n\) points, write an algorithm to compute the closest pair points.
In the figure above the closest pair of points have been marked in red. Given a set of points shown below, let \(d\) be the distance between the closest pair of point. Then what is the value of \(\left\lfloor 100d \right\rfloor\)?
\[S=\{(4,0), (6,2), (9,4), (8,9), (1,2), (3,5), (3, 1)\}\]
Let the two closest points in the following set of coordinate points be \(P_1=(x_1,y_1)\) and \(P_2 = (x_2,y_2)\). What is the value of \(x_1+y_1+x_2+y_2\)?
Given a polygon \(P\) and a point \(p\) implement an algorithm to check whether the point lies inside the polygon or not.
The algorithm should output \(1\) if the point is inside the polygon, and \(0\) if it isn't. Consider the following pairs of polygon and point shown below, if \(l_{n}\) in the value output by the algorithm for the \(n\)th pair of polygon and point, what is the value of the string \([l_{1}l_{2}l_{3}l_{4}]\)?
\(P_1=[(2, 1), (1, 3), (3, 3)], \\ p_1=(1,1)\)
\(P_2=[(2, 4), (4, 2), (6, 8), (8,6)], \\ p_2=(3,3)\)
\(P_3=[(5,2), (8,2), (8,4), (5,4)], \\ p_3=(6,1)\)
\(P_4= [(2,2), (2,2), (6,0), (6,0)], \\ p_4=(3,1)\)
Details and assumptions
The points lying on the border of the polygon are considering to be inside the polygon
How many of the \(24\) triangles below enclose the origin within their perimeter?
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 

Problem Loading...
Note Loading...
Set Loading...