Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information

摘要

We propose a linear working space algorithm for reconstructing a simple polygon from the visibility angle information at vertices up to similarity. We also modify the algorithm such that its running time is sensitive to the size of visibility graph and also the diameter of a triangulation of the polygon.