"Time and Space Efficient Algorithms for Shortest Paths Between Convex ..."

Hans Rohnert (1988)

> Home

Details and statistics

DOI: 10.1016/0020-0190(88)90022-1

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Rohnert88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Rohnert88
Hans Rohnert:
Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. Inf. Process. Lett. 27(4): 175-179 (1988)

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.