Question $1$:

Write a C$++$ and OpenGL program to compute and draw the point of the intersection of two segments. Segment endpoints should be defined using mouse clicks.

Use the algorithm discussed in the class and in the course textbook $($page $170,$ section $4\mathrm{.}6)$ to find the intersection of two segments.

Pay particular attention to the design of a clean, well$-$organized, and efficient program. Define appropriate functions and data structures for your program, and comment on your code as much as possible.

Question $2$:

Improve your program so that it handles more than two segments and computes the intersections of all the segments

ts

$1$

Example: trace segments $s1$ and s$2,$ then compute and visualize their intersection. Trace segment s$3,$ then check and visualize its intersections $($if any$)$ with segments s$1$ and s$2.$ Trace segment s$4,$ then check and visualize its intersections $($if any$)$ with segments $s1,s2,$ and $s3.$