Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference21 articles.
1. J. Abello, O. Egecioglu, and K. Kumar, Visibility graphs of staircase polygons and the weak Bruhat order, I: from visibility graphs to maximal chains,Discrete & Computational Geometry, 14(3) (1995), 331–358.
2. J. Abello, O. Egecioglu, and K. Kumar, Visibility graphs of staircase polygons and the weak Bruhat order, II: from maximal chains to polygons, preprint.
3. Visibility graphs and oriented metroids;J. Abello,1995
4. J. Abello, H. Lin, and S. Pisupati, On visibility graphs of simple polygons,Congressus Numeratium, 90 (1992), 119–128.
5. D. Avis and D. Rappaport, Computing the largest empty convex subset of a set of points,Proceedings of the First ACM Symposium on Computational Geometry, pp. 161-167, 1985.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Half Guarding Polygons;Combinatorial Optimization and Applications;2023-12-09
2. Coloring polygon visibility graphs and their generalizations;Journal of Combinatorial Theory, Series B;2023-07
3. On the Complexity of Half-Guarding Monotone Polygons;LATIN 2022: Theoretical Informatics;2022
4. Clique-width of point configurations;Journal of Combinatorial Theory, Series B;2021-09
5. LTA*: Local tangent based A* for optimal path planning;Autonomous Robots;2021-01-07