Exact, robust and efficient full visibility computation in the Plücker space
Résumé
We present a set of new techniques to compute an exact polygon-to-polygon visibility in the Plücker space. The contributions are based on the definition of the minimal representation of lines stabbing two convex polygons. The new algorithms are designed to highly discriminates useless computations, which result in more compact visibility data, fastest to exploit, and in a reduced computation time. We also define a simple robust and exact solution to handle degeneracies, where previous methods proposed aggressive solutions.