Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
Work
Year: 1987
Type: article
Source: Algorithmica
Institutions Stanford University, Tel Aviv University, Princeton University
Cites: 30
Cited by: 512
Related to: 10
FWCI: 14.76
Citation percentile (by year/subfield): 99.71
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed