default search action

combined dblp search
author search
venue search
publication search

ask others

"A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded ..."

Jean-Daniel Boissonnat, Sylvain Lazard (2003)

> Home

Details and statistics

DOI: 10.1142/S0218195903001128

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcga/BoissonnatL03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcga/BoissonnatL03
Jean-Daniel Boissonnat, Sylvain Lazard:
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles. Int. J. Comput. Geom. Appl. 13(3): 189-229 (2003)

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.