Award Date

1-1-1996

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

Number of Pages

47

Abstract

This thesis deals with the problem of computing shortest watchman routes in the presence of polygonal obstacles. Important recent results on watchman route problems are surveyed. An {dollar}O(n\sp3){dollar} algorithm for computing a shortest watchman route in the presence of a pair of convex obstacles is presented. Important open problems related to watchman route problems are discussed.

Keywords

Convex; Obstacles; Presence; Routes; Watchman

Controlled Subject

Computer science; Mathematics; Mechanical engineering

File Format

pdf

File Size

1116.16 KB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Permissions

If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.

Identifier

https://doi.org/10.25669/5zpc-8g45


Share

COinS