Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. In Symposium on Computational Geometry. pages 1-13, 1986. [doi]

This author has not been identified. Look up 'Leonidas J. Guibas' in GoogleThis author has not been identified. Look up 'John Hershberger' in GoogleThis author has not been identified. Look up 'Daniel Leven' in GoogleThis author has not been identified. Look up 'Micha Sharir' in GoogleThis author has not been identified. Look up 'Robert Endre Tarjan' in Google

runs on WebDSL