Computational geometry column 18
ACM SIGACT News
Computing the maximum clique in the visibility graph of a simple polygon
Journal of Discrete Algorithms
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
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 |