We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility map of such a terrain with n triangles is ¿(n2) in the worst case. We prove that if the elevations of the vertices of the terrain are subject to uniform noise which is proportional to the edge lengths, then the worst-case expected (smoothed) complexity is only ¿(n). This provides an explanation why visibility maps of superlinear complexity are unlikely to be encountered in practice.
|Title of host publication||Proceedings 25th Annual ACM Symposium on Computational Geometry (SoCG'09, Aarhus, Denmark, June 8-10, 2009)|
|Place of Publication||New York NY|
|Publisher||Association for Computing Machinery, Inc|
|Publication status||Published - 2009|