scholarly journals THE IMPLICIT PATH COST OPTIMIZATION IN DIJKSTRA ALGORITHM USING HASH MAP DATA STRUCTURE

2019 ◽  
Author(s):  
Mabroukah Amarif ◽  
Ibtusam Alashoury
Keyword(s):  
Data Structure ◽  
Cost Optimization ◽  
Dijkstra Algorithm ◽  
Path Cost ◽  
Map Data

scholarly journals Development of CAD/CAM System Based on Boundary-Map Data Structure.

2000 ◽  
Vol 66 (7) ◽  
pp. 1048-1052 ◽  
Author(s):  
Mikio FUJIO ◽  
Hukuzo YAGISHITA ◽  
Hiroshi SUZUKI
Keyword(s):  
Data Structure ◽  
Boundary Map ◽  
Cad Cam ◽  
Map Data

scholarly journals Question-led approach in designing Dijkstra algorithm game-based learning: A pilot study

2020 ◽  
Vol 9 (4) ◽  
pp. 926
Author(s):  
Rosni Binti Ramle ◽  
D’oria Islamiah Rosli ◽  
Shelena Soosay Nathan ◽  
Mazniha Berahim
Keyword(s):  
Data Structure ◽  
Pilot Study ◽  
Teaching Tool ◽  
Game Model ◽  
Dijkstra Algorithm ◽  
Game Based Learning ◽  
Learning Context ◽  
Graph Data ◽  
Self Regulated Learning ◽  
Post Test

Dijkstra algorithm is important to be understood because of its many uses. However, understanding it is challenging. Various methods to teach and learn had been researched, with mixed results. The study proposes questionled approach of the algorithm in a game-based learning context. The game designed based on an existing game model, developed and tested by students. Pre- and post-game tests compared and game feedback survey analysed. Results showed that students’ performance in graph data structure Dijkstra algorithm improved after playing the game where post-test mark was higher than pre-test. Game feedback were mostly positive, with areas of improvement. Students may use the game as a learning tool for self-regulated learning. Educators may get some ideas on how to design teaching tool using question-led approach.

scholarly journals Incorporating Topological Representation in 3D City Models

2019 ◽  
Vol 8 (8) ◽  
pp. 347 ◽  
Author(s):  
Stelios Vitalis ◽  
Ken Ohori ◽  
Jantien Stoter
Keyword(s):  
Data Structure ◽  
Data Model ◽  
Semantic Information ◽  
Semantic Representation ◽  
Geometric Analysis ◽  
Computationally Efficient ◽  
Real World Data ◽  
3D City Models ◽  
Map Data ◽  
City Models

3D city models are being extensively used in applications such as evacuation scenarios and energy consumption estimation. The main standard for 3D city models is the CityGML data model which can be encoded through the CityJSON data format. CityGML and CityJSON use polygonal modelling in order to represent geometries. True topological data structures have proven to be more computationally efficient for geometric analysis compared to polygonal modelling. In a previous study, we have introduced a method to topologically reconstruct CityGML models while maintaining the semantic information of the dataset, based solely on the combinatorial map (C-Map) data structure. As a result of the limitations of C-Map’s semantic representation mechanism, the resulting datasets could suffer either from semantic information loss or the redundant repetition of them. In this article, we propose a solution for a more efficient representation of geometry, topology and semantics by incorporating the C-Map data structure into the CityGML data model and implementing a CityJSON extension to encode the C-Map data. In addition, we provide an algorithm for the topological reconstruction of CityJSON datasets to append them according to this extension. Finally, we apply our methodology to three open datasets in order to validate our approach when applied to real-world data. Our results show that the proposed CityJSON extension can represent all geometric information of a city model in a lossless way, providing additional topological information for the objects of the model.

A Fast Algebraic Grid Generation Algorithm Base on an Improved Kamaugh Map

2009 ◽  
Vol 69-70 ◽  
pp. 670-674
Author(s):  
Shu Dong Xiu ◽  
Shi Jun Ji ◽  
Yang Wang
Keyword(s):  
Data Structure ◽  
Grid Generation ◽  
Complex Surface ◽  
Algebraic Operation ◽  
Generation Algorithm ◽  
Spline Surface ◽  
Algebraic Formula ◽  
Map Data ◽  
Algorithm Base ◽  
Prototype Design

A fast algebraic grid generation algorithm is proposed and a improved Kamaugh map data structure for the new algorithm is designed in the paper. The new created vertex inside of the region is based on algebraic operation of the corner vertices and the middle vertices of boundary broken lines on the region and the program data structure is a improved Kamaugh map data structure, so the algorithm has the merit of simple algebraic formula, quickly executing speed and powerful technology for the four-sided region enclosed by four broken lines, the algorithm is realized on the four-sided region and B-spline surface on the complex surface. The algorithm is extensively applicable for shape modeling in computer aided geometric design, industrial prototype design and reverse engineering.

The Map Data Structure

2020 ◽  
pp. 99-103
Author(s):  
Ray Lischner
Keyword(s):  
Data Structure ◽  
Map Data
Sign in / Sign up

Export Citation Format

Share Document