Show simple item record

dc.contributor.authorOr, Daniel Cohenen_US
dc.contributor.authorShaked, Amiten_US
dc.date.accessioned2014-10-21T07:37:45Z
dc.date.available2014-10-21T07:37:45Z
dc.date.issued1995en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/j.1467-8659.1995.cgf143-0171.xen_US
dc.description.abstractThe problem of detecting the visible and hidden areas of a topographic surface from a given viewpoint is well known, and has applications in GIS and other fields. The computational geometry literature is rich with solutions based on a polygonal representation of the surface. This work confronts the problem by working directly on the Digital Elevation Map which represents the terrain surface. We present an algorithm that processes discrete lines of sight from the viewpoint to the surface perimeter, and tests the unit-sized terrain elements along the discrete cross-sections defined by these lines. The algorithm is very efficient, performing O(n) testing operations, consisting of a few additions and no more than one multiplication each, where n is the number of the terrain elements in the map.en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleVisibility and Dead-Zones in Digital Terrain Mapsen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume14en_US
dc.description.number3en_US
dc.identifier.doi10.1111/j.1467-8659.1995.cgf143-0171.xen_US
dc.identifier.pages171-180en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record