Name
Abstract | ||
|---|---|---|
Visibility preprocessing is a useful method to reduce the complexity of scenes to be processed in real-time, and so enhances the overall rendering performance for interactive visualization of virtual environments. In this paper, we propose an efficient visibility preprocessing method. The proposed method is able to handle more general environments, like urban environments, and remove invisible polygons jointly blocked by multiple occluders. The proposed method requires O(nm) time and O(n+m) space. By selecting a suitable value for m. user can select a suitable level of trade-off between the preprocessing time and the quality of the computational result. In the proposed method, we assume that navigatable areas in virtual environments are partitioned into rectangular parallelepiped cells or sub-worlds. To preprocess the visibility of each polygon for a given partitioned cell, we should determine at least the area-to-area visibility. That is inherently a four-dimensional problem. In the proposed method, we efficiently express four-dimensional visibility information on two-dimensional spaces and keep it within a ternary tree. which is conceptually similar to a BSP(Binary Space Partitioning) tree, by exploiting the characteristics of conservative visibility. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1145/502390.502413 | VRST |
Keywords | DocType | ISBN |
efficient visibility,conservative visibility,visibility determination,four-dimensional visibility information,preprocessing time,four-dimensional problem,occlusion culling,visibility preprocessing,useful method,virtual environment,complex urban scene,area-to-area visibility,interactive visualization | Conference | 1-58113-316-2 |
Citations | PageRank | References |
3 | 0.50 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| JunHyeok Heo | 1 | 3 | 1.52 |
| Jaeho Kim | 2 | 3 | 0.50 |
| KwangYun Wohn | 3 | 309 | 42.24 |