Visibility maps of realistic terrains have linear smoothed complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry, 2009•dl.acm.org
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 θ (n 2) 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 …
and have roughly the same size. It is known that the complexity of the visibility map of such a
terrain with n triangles is θ (n 2) 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 …
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.
ACM Digital LibraryShowing the best result for this search. See all results