Exact, robust and efficient full visibility computation in Pluecker space

摘要

We present a set of new techniques to compute an exact polygon-to-polygon visibility in Pliicker space. The contributions are based on the definition of the minimal representation of lines stabbing two convex polygons. The new algorithms are designed to indicate useless computations, which results in more compact visibility data, faster to exploit, and in a reduced computation time. Wernalso define a simple robust and exact solution to handle degeneracies, where previous methods proposed aggressive solutions.