Orthogonal polygon reconstruction from stabbing information
Computational Geometry: Theory and Applications
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Non-stretchable pseudo-visibility graphs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Non-stretchable pseudo-visibility graphs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
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 |