"An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal ..."

Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell (1997)

> Home

Details and statistics

DOI: 10.1007/PL00009323

access: open

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dcg/KapoorMM97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/KapoorMM97
Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell:
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discret. Comput. Geom. 18(4): 377-383 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.