Visibility maps of realistic terrains have linear smoothed complexity

M.T. Berg, de, H.J. Haverkort, C.P. Tsirogiannis

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings 25th Annual ACM Symposium on Computational Geometry (SoCG'09, Aarhus, Denmark, June 8-10, 2009)
Place of PublicationNew York NY
PublisherAssociation for Computing Machinery, Inc
Pages163-168
ISBN (Print)978-1-60558-501-7
DOIs
Publication statusPublished - 2009

Fingerprint Dive into the research topics of 'Visibility maps of realistic terrains have linear smoothed complexity'. Together they form a unique fingerprint.

Cite this