Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Finding the shortest watchman route in a simple polygon
Luleå tekniska universitet.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
Department of Computer Science, Lund University.
1993 (English)In: Algorithms and Computation 4th International Symposium, ISAAC '93: Proceedings / [ed] K.W. Ng, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 1993, p. 58-67Conference paper, Published paper (Refereed)
Abstract [en]

We present the first polynomial-time algorithm that finds the shortest route in a simple polygon such that all points of the polygon is visible from some point on the route. This route is sometimes called the shortest watchman route, and it does not allow any restrictions on the route or on the simple polygon. Our algorithm runs in O(n 3) time.

Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 1993. p. 58-67
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 762
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-32182DOI: 10.1007/3-540-57568-5_235Local ID: 69807180-a0e2-11db-8975-000ea68e967bISBN: 978-3-540-57568-9 (print)OAI: oai:DiVA.org:ltu-32182DiVA, id: diva2:1005416
Conference
International Symposium on Algorithms and Computation : 15/12/1993 - 17/12/1993
Note
Godkänd; 1993; 20070110 (ysko)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-01-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Jonsson, Håkan

Search in DiVA

By author/editor
Jonsson, Håkan
By organisation
Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 17 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf