Visibility Complexity of a Region in Flatland
| dc.contributor.author | Rigau, Jaume | en_US |
| dc.contributor.author | Feixas, Miquel | en_US |
| dc.contributor.author | Sbert, Mateu | en_US |
| dc.date.accessioned | 2015-11-11T18:03:37Z | |
| dc.date.available | 2015-11-11T18:03:37Z | |
| dc.date.issued | 2000 | en_US |
| dc.description.abstract | The aim of this paper is to study the visibility complexity of different regions in a 2D scene. Based on mutual information, which we used in our previous work to define scene complexity, we propose two measures that quantify the complexity of a region from two different points of view. The knowledge of the complexity of a region can be useful to determine how difficult it is to recompute the visibility links for an animation depending on the regions visited or to obtain the complexity of the movement of a robot. We also envisage its applicability to obtain an optimal load balancing in a parallel computation by dividing the geometry in equal complexity regions. | en_US |
| dc.description.seriesinformation | Eurographics 2000 - Short Presentations | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egs.20001021 | en_US |
| dc.publisher | Eurographics Association | en_US |
| dc.title | Visibility Complexity of a Region in Flatland | en_US |