Visibility maps of realistic terrains have linear smoothed complexity

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

Research output: Contribution to journalArticleAcademicpeer-review

185 Downloads (Pure)

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 T(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 T(n). We also prove non-trivial bounds for the smoothed complexity of instances where some triangles do not satisfy the above properties. Our results provide an explanation why visibility maps of superlinear complexity are unlikely to be encountered in practice.
Original languageEnglish
Pages (from-to)57-71
JournalJournal of Computational Geometry
Volume1
Issue number1
Publication statusPublished - 2010

Fingerprint

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

Cite this