NDLI: Efficient viewshed computation on terrain in external memory

Content Provider	Springer Nature Link
Author	Andrade, Marcus V. A. Magalhães, Salles V. G. Magalhães, Mirella A. Franklin, W. Randolph Cutler, Barbara M.
Copyright Year	2009
Abstract	The recent availability of detailed geographic data permits terrain applications to process large areas at high resolution. However the required massive data processing presents significant challenges, demanding algorithms optimized for both data movement and computation. One such application is viewshed computation, that is, to determine all the points visible from a given point p. In this paper, we present an efficient algorithm to compute viewsheds on terrain stored in external memory. In the usual case where the observer’s radius of interest is smaller than the terrain size, the algorithm complexity is θ(scan(n 2)) where n 2 is the number of points in an n × n DEM and scan(n 2) is the minimum number of I/O operations required to read n 2 contiguous items from external memory. This is much faster than existing published algorithms.
Starting Page	381
Ending Page	397
Page Count	17
File Format	PDF
ISSN	13846175
Journal	GeoInformatica
Volume Number	15
Issue Number	2
e-ISSN	15737624
Language	English
Publisher	Springer US
Publisher Date	2009-11-26
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	GIS External memory processing Viewshed Visibility maps Multimedia Information Systems Geographical Information Systems/Cartography Computer Science Information Storage and Retrieval Data Structures, Cryptology and Information Theory
Content Type	Text
Resource Type	Article
Subject	Geography, Planning and Development Information Systems

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficiently computing the drainage network on massive terrains using external memory flooding process

Recognizing text in raster maps

Parallel Processing for Terrain Analysis in GIS: Visibility as a Case Study

Approximating the Visible Region of a Point on a Terrain

Computation of Random Errors in Digital Terrain Models

Comparing G-maps with other topological data structures

Unified Hybrid Terrain Representation Based on Local Convexifications

Retrospective adaptive prefetching for interactive Web GIS applications

Generic and efficient framework for search trees on flash memory storage systems

Efficient viewshed computation on terrain in external memory

Similar Documents

Efficiently computing the drainage network on massive terrains using external memory flooding process

Recognizing text in raster maps

Parallel Processing for Terrain Analysis in GIS: Visibility as a Case Study

Approximating the Visible Region of a Point on a Terrain

Computation of Random Errors in Digital Terrain Models

Comparing G-maps with other topological data structures

Unified Hybrid Terrain Representation Based on Local Convexifications

Retrospective adaptive prefetching for interactive Web GIS applications

Generic and efficient framework for search trees on flash memory storage systems

Efficient viewshed computation on terrain in external memory