"Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time."

Svante Carlsson, Håkan Jonsson (1995)

> Home

Details and statistics

DOI: 10.1007/3-540-60220-8_56

access: closed

type: Conference or Workshop Paper

metadata version: 2023-08-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wads/CarlssonJ95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/CarlssonJ95
Svante Carlsson, Håkan Jonsson:
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. WADS 1995: 122-134

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.