External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Approximate Euclidean Shortest Paths in Polygonal Domains

R. Inkulu, Sanjiv Kapoor. Approximate Euclidean Shortest Paths in Polygonal Domains. In Pinyan Lu, Guochuan Zhang, editors, 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China. Volume 149 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Authors

R. Inkulu

This author has not been identified. Look up 'R. Inkulu' in Google

Sanjiv Kapoor

This author has not been identified. Look up 'Sanjiv Kapoor' in Google
runs on