intracse - aspiration -3

3.Line Intersection

Problem Description

Suppose you have N number of points in 2D plane.
Identify the straight lines with the given set of points.
You have to find the possible intersection from identified set of lines.
The intersecting lines must not share any common points.
If intersection is possible then return true otherwise false.
Points are always Integer type.
Example:
Suppose the given points[][]={{1,0},{0,1},{1,1},{2,4}},then possible line segments will be:

There are no any intersection in the given 2D points,So output will be false.

If the given points[][]={{1,0},{0,1},{1,1},{2,4},{0,0}},then these points will be intersect each other at any points,So the output will be true

Instructions to use Open PBT Client:

Specify the work directory path in the 'Work Directory Path' field. The path should correspond to your solution work directory.
Download the Support files by clicking the Get Support Files.
You will find the problem directories containing:
- problem.h file
- problem.c file

in your work directory.

Write your solution in .c file

Step 1:

In your Solution File:
Add a function bool intersections(int points[][]).

Step 2:

Pass the following parameter to the function intersections().

int points[][] :points is a two dimension integer array.

Step 3:

Write the appropriate code to find the subset whose sum is zero based on below given Constraints.

In this problem you have to find the intersection of lines formed by the given points is possible or not.
All the points are in 2D plane.
End point of two intersecting lines should not be common.
public boolean intersections(int points[][]) will return true when lines will intersect and false when lines doesn't intersect.
int points[][] is Integer two dimensional array of points in the 2D plane
If the given points in 2D array is null then return false.
If intersection is possible then return true otherwise false

The prototype of the function is:

public bool intersections(int points[][])
The function will take a two dimension integer array, which represents the set of points and returns the corresponding boolean value as per the problem statement.

Constraint:

If the given points in 2Darray is null then return false .

Example 1

Input:

points[][]:

{{1,0},{0,1},{1,1},{2,4},{0,0}}

Output:
true

Explanation:When we will draw the lines according to given points then they will intersect each other.

Example 2

Input:

points[][]:

{{1,0},{0,1},{1,1},{2,4}}

Output:
false

For C solutions

Header File :	LineIntersection.h
File Name :	LineIntersection.c
Function Name :	bool intersections(int points[][]);

For C++ solutions

Header File	:	LineIntersection.h
Class Name	:	LineIntersection
Function Name	:	bool intersections(int points[][]);
FileName	:	LineIntersection.cpp

General Instructions

*	The file / class names, functions, method signatures, header files to be used are mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods.
*	Do not forget to mention the file extension, either .c or .cpp as the case maybe.
*	For C solutions, change the value of "C_OR_CPP" macro in header file to 1 and for C++ solutions change the value to 2.
*	Incase of iostream.h specify as iostream only.