Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
Algorithmica1987Vol. 2(1-4), pp. 209–233
Citations Over TimeTop 1% of 1987 papers
Related Papers
- → Computing the visibility graph of points within a polygon(2004)39 cited
- → Maintaining the Visibility Graph of a Dynamic Simple Polygon(2019)6 cited
- → Computing Visibility Information in an Inaccurate Simple Polygon(1997)17 cited
- → Pseudo-triangulating a simple polygon from its visibility graph(2015)1 cited
- Fast algorithm for triangulation of simple polygon(2010)