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

Jean-Daniel Boissonnat, Sylvain Lazard (1996)

> Home

Details and statistics

DOI: 10.1145/237218.237393

access: closed

type: Conference or Workshop Paper

metadata version: 2021-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/compgeom/BoissonnatL96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/BoissonnatL96
Jean-Daniel Boissonnat, Sylvain Lazard:
A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). SCG 1996: 242-251

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.