On recognizing and characterizing visibility graphs of simple polygons
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Nonrealizability proofs in computational geometry
Discrete & Computational Geometry
Visibility graph recognition
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Vertex-edge pseudo-visibility graphs: characterization and recognition
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Handbook of discrete and computational geometry
The vertex-edge visibility graph of a polygon
Computational Geometry: Theory and Applications
Visibility Graphs and Oriented Matroids
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Planar minimally rigid graphs and pseudo-triangulations
Proceedings of the nineteenth annual symposium on Computational geometry
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Non-stretchable pseudo-visibility graphs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Non-stretchable pseudo-visibility graphs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
| Hi-index | 0.00 |