Algorithm Visualization System for Teaching Spatial Data Algorithms

Posted by Isra Anwar

March 24, 2014

Spatial details is details that is located in a multidimensional area (Laurini & Thompson, 1992). In other words, each spatial details product is identified by a set of harmonizes, which define its place in relation to other details products. Thus, each spatial details product contains spatial details (coordinates) that explains the place of the product and associated attribute details that explains what it represents. Spatial details is used in numerous professions, such as geographical pc (GIS), pc design, robotics, virtual reality, computer-aided style, biology, VLSI style, and many others. In the perspective of GIS and relevant professions, the details is assumed to model geographical locations on the Planet's area and their associated qualities. In this paper, we discuss spatial details in this perspective. In GIS, there are at least two organize axes (x and y, which signify geographical longitude and latitude), and two additional ones (height and time) can also be used. Spatial details methods (SDA) are methods designed to process and operate such details and spatial details components are entities used to store the details.

Spatial details components are based on regular non-spatial details components such as arrays and trees, as well as methods that operate these primary components. However, the multidimensional characteristics of spatial details creates them more complex than the primary details components. This also creates the style and execution of effective spatial details methods more difficult. For example, dictionary components for spatial details must be able to locate details products according to their harmonizes instead of using one-dimensional key values.

Read Also

Furthermore, the spatial characteristics of the details creates teaching spatial details methods more challenging than primary non-spatial details components and methods. For example, to be able to demonstrate both how details products are relevant to each other and how they are arranged in a details structure, generally two cases are required: one to demonstrate the details products and the area they take up, and another to demonstrate the details components. Consequently, the student must be able to connect the cases to be able to comprehend how the details is organized. In primary details components, however, the relationships between the details products are generally recognizable with just a single picture.

SDA and associated details components are a fundamental element of geoinformatics, a division of technology where details technology is applied to cartography and geosciences. The details geoinformatics studies is place details on the Planet's area, and therefore SDA are needed for effective storage and processing. Geoinformatics is also closely relevant to cartography, and therefore many different kinds of cases are used. Charts are the most fundamental way to signify spatial details. Creation of maps is in itself a large, varied and important field (Slocum, McMaster, Kessler, & Howard, 2004). However, since many spatial details sets have several qualities for each place, other visualization methods are also needed for knowing the details. For example, multivariate visualization methods such as parallel organize plots or star plots can be used in conjunction with map opinions. A map view shows how the details is distributed geographically, while other opinions display what details the details contains.

Software Creation (SV) is a division of application technological innovation that is designed to use design and computer animation to demonstrate the different aspects of application (Stasko, Domingue, Brown, & Cost, 1998). Cost, Baecker, and Small (1993) split SV into two subcategories: program visualization (PV) and criteria visualization (AV). PV is the use of various visual methods to enhance the human knowing of applications. It is generally used to demonstrate real, implemented applications. AV, however, demonstrates abstractions of algorithmic concepts and is independent of any real criteria execution.