Focal point computation and homogeneous geometrical transformation for linear curves

In computer graphics, computer aided design, solid modelling and robotics and pattern recognition evaluation of focal point for a collection of line segments is the bottleneck problem. In the computer era the significant importance is given to this problem in present research world, however resolving its complexity has persisted imperceptible. This paper presents an efficient and optimal algorithm to evaluate intersection point in Euclidean space by evolving the mathematical analysis. Analysis of mathematics of the algorithm is rather seems to be intricate but implementation of algorithm is simple and straightforward.