SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "onr:"swepub:oai:DiVA.org:ltu-32182" "

Search: onr:"swepub:oai:DiVA.org:ltu-32182"

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Carlsson, Svante, et al. (author)
  • Finding the shortest watchman route in a simple polygon
  • 1993
  • In: Algorithms and Computation 4th International Symposium, ISAAC '93. - Berlin : Encyclopedia of Global Archaeology/Springer Verlag. - 9783540575689 ; , s. 58-67
  • Conference paper (peer-reviewed)abstract
    • 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.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
conference paper (1)
Type of content
peer-reviewed (1)
Author/Editor
Jonsson, Håkan (1)
Nilsson, Bengt J. (1)
Carlsson, Svante (1)
University
Luleå University of Technology (1)
Language
English (1)
Research subject (UKÄ/SCB)
Natural sciences (1)
Year
1993 (1)

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view