Loading...
Please wait, while we are loading the content...
Similar Documents
Maintaining Visibility Polygon of a Moving Point Observer in Polygons with Holes
| Content Provider | Semantic Scholar |
|---|---|
| Author | Zarei, Alireza Khosravi, Amir Ali Ghodsi, Mohammad |
| Copyright Year | 2006 |
| Abstract | Computing the visible region from a moving point in planar environments has many applications in computer graphics and computational geometry. This problem has been considered thoroughly before and several algorithms have been proposed for it. Almost all these solutions use a preprocessing step to build data structures which re∞ect the visibility coherence of the scene. Then, this data is used to facilitate visibility computation for the moving observer. Since combinatorial structure of the observer visible area is changed in discrete points along its motion path, these algorithms maintain a queue of events which specifles these points. Unfortunately, in these algorithms either some unnecessary events are handled or their handling time is not e‐cient. In this paper, we present an algorithm for this problem which processes only necessary events as well as the events are handled efflciently. This algorithm uses the method of [1] to preprocess the scene. Although this preprocessing step is expensive, it helps to flnd and maintain visibility polygon of an arbitrary moving observer more e‐ciently. The method of [1] computes visibility polygon of a point and here we extend that method for a moving point observer. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://sharif.edu/~ghodsi/papers/zarei-khosravi-csicc2006.pdf |
| Alternate Webpage(s) | http://sharif.ac.ir/~ghodsi/papers/zarei-khosravi-csicc2006.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
