Art gallery theorems and algorithms
Art gallery theorems and algorithms
Visibility graph recognition
Negative results on characterizing visibility graphs
Computational Geometry: Theory and Applications
Cross-ratios and angles determine a polygon
Proceedings of the fourteenth annual symposium on Computational geometry
The vertex-edge visibility graph of a polygon
Computational Geometry: Theory and Applications
Stabbing information of a simple polygon
Discrete Applied Mathematics
Characterizing bar line-of-sight graphs
SCG '85 Proceedings of the first annual symposium on Computational geometry
A polygon is determined by its angles
Computational Geometry: Theory and Applications
An improved algorithm for reconstructing a simple polygon from its visibility angles
Computational Geometry: Theory and Applications
Reconstructing a simple polygon from its angles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
An improved algorithm for reconstructing a simple polygon from the visibility angles
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Perspective: Simple agents learn to find their way: An introduction on mapping polygons
Discrete Applied Mathematics
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Reconstruction of polygons from visibility information is known to be a difficult problem in general. In this paper, we consider a special case: reconstruction of orthogonal polygons from horizontal and vertical visibility information and show that this reconstruction can be performed in O(n log n) time.