ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    External watchman routes (1994)
    Springer
    The visual computer 10 (1994), S. 474-483 
    Details
    ISSN: 1432-2315
    Keywords: Watchman routes ; Visibility ; Art gallery problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We consider the problem of finding a shortest watchman route from which the exterior of a polygon is visible (external watchman route). We present an O (n 4 log logn) algorithm to find shortest external watchman routes for simple polygons by transforming the external watchman route problem to a set of internal watchman route problems. Also, we present faster external watchman route algorithms for special cases. These include optimal O (n) algorithms for convex, monotone, star and spiral polygons and an O (n log logn) algorithm for rectilinear polygons.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01910637
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...