Ghosh , Subir Kumar (1988) Computing a viewpoint of a set of points inside a polygon Lecture Notes in Computer Science, 338 . pp. 18-29. ISSN 0302-9743
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/p50r478228t855...
Related URL: http://dx.doi.org/10.1007/3-540-50517-2_68
Abstract
Given a set S of k points inside an n-sided simple polygon P, the problem is to find a point g of P, if it exists, such that all points of S are visible from g. Here we propose an algorithm for this problem that runs in O(n+k) time in the worst case and takes an O(nloglogn+klogn+klogk) time for preprocessing.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer. |
| ID Code: | 76290 |
| Deposited On: | 31 Dec 2011 08:55 |
| Last Modified: | 31 Dec 2011 08:55 |
Repository Staff Only: item control page
