Computing the maximum clique in the visibility graph of a simple polygon
Journal of Discrete Algorithms
An improved algorithm for reconstructing a simple polygon from the visibility angles
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |