Finds the essential matrix given exactly 5 corresponding points. The approach is described in details in  and works by linearlizing the problem then solving for the roots in a polynomial. It is considered one of the fastest and most stable solutions for the 5-point problem.
THIS IMPLEMENTATION DOES NOT CONTAIN ALL THE OPTIMIZATIONS OUTLIED IN . A full implementation is quite involved. Example: SVD instead of the proposed QR factorization.
NOTE: This solution could be generalized for an arbitrary number of points. However, it would complicate the algorithm even more and isn't considered to be worth the effort.
 David Nister "An Efficient Solution to the Five-Point Relative Pose Problem" Pattern Analysis and Machine Intelligence, 2004
processComputes the essential matrix from point correspondences.
points- Input: List of points correspondences in normalized image coordinates
solutions- Output: Storage for the found solutions. .
- true for success or false if a fault has been detected