Abstract
Summary 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
