More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"Fast computation of shortest watchman routes in simple polygons."

Xuehou Tan (2001)

> Home

Details and statistics

DOI: 10.1016/S0020-0190(00)00146-0

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Tan01a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Tan01a
Xuehou Tan:
Fast computation of shortest watchman routes in simple polygons. Inf. Process. Lett. 77(1): 27-33 (2001)

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.